Problem
1. What is the maximum depth of recursion in the function solve_from?
2. Starting with the following partial configuration of five queens on the board, construct the recursion tree of all situations that the function solve_from will consider in trying to add the remaining three queens. Stop drawing the tree at the point where the function will backtrack and remove one of the original five queens.