Use the generic graph I h(x) 3 A 6 B 5 B 4 1 5 C 2 3 D 2 E 1 F F 0 34 search method covered in class, carry out BFS, DFS, uniform-cost, and A* over the graph and the heuristic function given in the figure. The start state is x1 = A and the goal state is XG = F. 6 5 For a given state, its neighbors appear in the ad- jacency list in an alphabetical order. For example, C's neighbors are ordered as A, B, D, E, F. To make it simpler to write down the solution, du- plicate nodes may be removed from the queue (without changing the behavior of the algorithm). Your answer should start with the initial queue followed by the status of the search after each while loop. Search status should be given as the node that gets expanded followed by the current queue. For each search, you only need to provide the complete list of statuses. For uniform-cost and A*, the entries in the queue should be accompanied by the value of the evaluation function; use alphabetical order for breaking ties. As an example, the first two entries of the answer for uniform-cost search should be: 1. q = [A(0)] 2. A, q= [B(3), D(4), C(5)]