4. [20 points] This question is on properties of search algorithms. Consider the following algorithms: o depth-first, breadth-first, o depth-limited depth first, o iterative deepening depth first, o bidirectional. You need to explain the reasons for your answers, not simply write the name of one algorithm. 1. if you want to limit the memory requirements, which algorithm(s) would you choose? why? 2. if you want to limit the time required the find a solution, which algorithm(s) would you choose? why? 3. if you want to find the minimum cost solution, which algorithm(s) would you choose? why? 4. if you want to solution with the minimum number of steps, but you do not want to use a lot of memory. which algorithm(s) would you choose? why