AMC 10 2017b Problem 6

What is the largest number of solid $2\text{-in} \times 2\text{-in} \times 1\text{-in}$ blocks that can fit in a $3\text{-in} \times 2\text{-in}\times3\text{-in}$ box? $\textbf{(A)}\ 3 \textbf{(B)}\ 4 \textbf{(C)}\ 5 \textbf{(D)}\ 6 \textbf{(E)}\ 7$