if we develop the complete tree/graph, what will be the smallest number of edges on a [5 pts] path to a leaf (game over, 0 coins on the table)?