In this question you are given different state spaces and need to specify which algorithm(s) are guaranteed to find a solution if a solution exists, or find that there is no solution. Consider the following cases: 1. the search space is finite. Which algorithm(s) have the guarantee specified above? 2. the search space is finite and has cycles. Would your answer change or not and why? 3. the search space is infinite, such as an infinite grid with a finite number of actions. Again, would your answer change or not and why?