Consider the state space shown to the left, where the number n by each state (circle) is the path cost and the table to the left shows the heuristic evaluation of the cost from each node n to the goal. Write down the order that the nodes would be searched in: (a) Breadth first search (b) Depth-first search (c) Uniform-cost search E J1 B 6 F (d) Iterative depth-first search (e) Greedy best-first search (f) A* search (g) For item (d) - calculate the overhead incurred by the iteration. A 8 G8 H 1 K 6 D7 nh(n) A 9 B4 C 5 D 5 E 6 F3 G4 H7 17 J1 K 1 Activate Windows Go to Settings to activate Windows.