Question 12
You are given an $m \times n$ chocolate bar divided into $1 \times 1$ squares. You can break a piece of chocolate by splitting it into two pieces along a straight line that does not cut through any of the $1 \times 1$ squares. What is the minimum number of times you have to break the bar in order to separate all the $1 \times 1$ squares?