Computer Science Algorithm quiz question. I will give thumb up, thank you!

Which search algorithms that we have learned so far would successfully navigate this maze? S denotes the start state and G denotes the goal state. "Success" here is defined as finding any solution. Assume that greedy best-first search and A* search both use the straight-line distance to the goal as the heuristic function (we'll talk about some more realistic heuristic functions later). Select one or more: Greedy best-first search Depth-first search Uniform-cost search A* search Breadth-first search