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 that the nodes are expanded in alphabetical order when no other order is specified by the search. Simulate 

• depth-first search (with and without a Visited list); 

• breadth-first search (with and without a Visited list).

3 B 1 C 5, 0( G H )1 4.