Consider a finite tree of depth d and branching factor b. (A tree consisting of only a root node has depth zero; a tree consisting of a root node and its It successors has depth 1; etc.) Suppose the shallowest goal node is at depth g
1. What is the minimum and maximum number of nodes that might be generated by a depth first search with depth bound equal to d?
2. What is the minimum and maximum number of nodes that might be generated by a breadthfint search?
3. What is the minimum and maximum number of nodes that might be generated by a depth first iterative-deepening search? (Assume that you start with an initial depth limit of 1 and increment the depth limit by 1 each time no goal is found within the current limit.)