Consider the problem of solving a jigsaw puzzle, in which pieces fit together to form larger connected blocks. Define a move to be the process of connecting one block of any size 1 to another block of any size 1. Thus connecting one piece to another piece counts as a move, and connecting one block of size 25 to a second block of size 8 also counts as one move. Use strong induction to prove that no matter how a puzzle is constructed and how the moves are carried out, exactly n 1 moves are needed to solve a puzzle with n pieces.