Consider the uninformed search algorithms from Chapter 3: depth-first, breadth-first, uniform cost, depth-limited depth first, iterative deepening depth first, and bidirectional. In your answers. Do not simply write the name of one algorithm, explain what algorithms you could use and, most important, why you would use them.

1. You have a large and shallow state space, with many actions for each state. Which search algorithm(s) would you use and why?
2. For the same large and shallow state space, with many actions for each state, which algorithm would you use if you are concerned about space complexity?
3. You have a deep and narrow state space with a finite number of states. Which search algorithm(s) would you use and why?
4. For the same deep and narrow state space with a finite number of states, which algorithm would you use if you are concerned about time complexity?