Problem 7 (2024 AMC 8)

A $3 \times 7$ grid is covered without overlap by $3$ shapes of tiles: $2 \times 2$, $1 \times 4$, and $1 \times 1$, shown below. What is the minimum possible number of $1 \times 1$ tiles used? [See figure in original PDF]