Consider the graph shown in the following figure, where $"$S$"$ is the start node and $"$G$1"$ and $"$G$2"$ satisfy the goal test. Arcs are labeled with $g(n)$ and the $h(n)$ is shown inside nodes.

For the three search strategies listed below:

Complete the table to indicate which goal state each reaches first, the associated cost, the solution path, and the number of nodes expanded.

Upload one handwritten file that illustrates the open and closed sets for each algorithm.

Note: Assume that ties are resolved by selecting the state that appears first alphabetically

$\backslash$table$[[$Search Type,goal,cost,solution path,$\backslash$table$[[$How many nodes$],[$were expanded?$]]],[\backslash$table$[[$Depth$-$first$],[$search$]],,,,],[\backslash$table$[[$Best$-$First$],[$Search$]],,,,],[A^{**}$ Search,,,,$]]$