title: How to find branching given time and depth for iterative deepening?
body: <p>My professor posed the following question and I really don't know how to start solving this problem. Any help is really welcomed. </p>
  
  <p><em>Let the space of the tree be a tree with a uniform branching b (each node has exactly b children). We are exploring the space with iterative deepening, starting with the root of the tree. The program finds the first solution at a depth of 3, in 0.2 seconds, and the next solution at a depth of 5 in 10 seconds. We know that the third solution is at depth 9. Estimate approximately how much time we can expect the program to need in order to find the third solution.</em></p>