Problem 2: Consider the graph shown below. The numbers on the edges are the edge costs and the numbers next to the states are heuristic estimates. Let S be the start state and G be the goal state. Assume 4 2 0 G H 1 that the nodes are expanded in alphabetical order when no other order is specified by the search. Please simulate depth first search (with and without a Visited list) breadth first search (with and without a Visited list) uniform cost search; and best first search. Show, step by step, Q and Visited list (if used). Problem 2: Consider the graph shown below. The numbers on the edges are the edge costs and the numbers next to the states are heuristic estimates. Let S be the start state and G be the goal state. Assume 4 2 0 G H 1 that the nodes are expanded in alphabetical order when no other order is specified by the search. Please simulate depth first search (with and without a Visited list) breadth first search (with and without a Visited list) uniform cost search; and best first search. Show, step by step, Q and Visited list (if used)