In this question you are given different state spaces and need to specify which uninformed search algorithm$($s$)$ are guaranteed to find a solution if a solution exists or report failure if there is no solution. Explain briefly your reasoning. Consider the following cases:

the search space is finite and is a tree. Which algorithm$($s$)$ have the guarantees specified above?

the search space is finite and is a graph with cycles. Would your answer change or not and why?

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?