what uninformed search algorithm $($or algorithms$)$ would you use? Here you should assume that the set of cities to be visited could be much larger than in the given example, it could have hundreds or thousands cities. Explain briefly your choice and if your choice changes with the size of the problem.$[30$ points$]$ This question is on properties of search algorithms. Consider the following uninformed search algorithms from Chapter $3\mathrm{.}3$: depth$-$first, breadth$-$first, uniform cost, depth$-$limited$,$ iterative deepening, and bidirectional search.

Suppose you have a large and shallow state space, with many actions for each state. Which search algorithm$($s$)$ would you use if you are concerned about time complexity, and which if you are concerned about space complexity? Explain your reasoning.

Suppose you have a deep and narrow state space with a finite number of states. Which search algorithm$($s$)$ would you use if you are concerned about time complexity, and which if you are concerned about space complexity? Explain your reasoning.

Suppose you have a search space with the same branching factor when searched from the start state and from the goal state, and with only one start state and one goal state. Is there an algorithm you would use? How and Why?