2) Please answer full question (a-e) showing detailed work for thumbs up.

This question is on properties of search algorithms. Consider the following uninformed search algorithms: depth-first, breadth-first, uniform cost, depth-limited depth first, iterative deepening depth first, and bidirectional. Answer the following questions. You need to explain the reasons for your answers, not simply write the algorithm name:

a) if you want to limit the memory requirements which algorithm(s) would you choose? why?

b) if you want to limit the time required the find a solution, which algorithm(s) would you choose? why?

c) if you want to find the minimum cost solution, which algorithm(s) would you choose? why?

d) if you want to find a solution with the minimum number of steps, which algorithm(s) would you choose? why?

e) if you want to find a solution with the minimum number of steps and you do not want to use a lot of memory, which algorithm(s) would you choose? why?