Problem 2. Search Algorithms [10 Points] Heneictir Consider the state space graph shown above. A is the start state and G is the goal state. The osts for each edge are shown on the graph. Each edge can be traversed in both directions. lease refer to the search algorithms exactly as presented on the lecture slides as the irdering of the actions matters. A) For each of the following graph search strategies, mark with an X which (if any) of the listed paths it could return. Note that for some search strategies the specific path returned might depend on tie-breaking behavior. In any such cases, make sure to mark all paths that could be returned under some tie-breaking scheme. (10 points))