. Consider the following graph with start state S and goal state G. The numbers on the arcs indicate the cost of traversing that arc. (a) Seek the best (least cost) path, using uniform-cost search, assuming nodes are considered in top- to-bottom order. (1) List the nodes in the order they would be expanded; at each step, list the nodes (with their path cost) stored in the frontier and the explored set. (2) list the nodes that lie along the final correct path to the goal. (b) Same as (a), but using the greedy best-first search using the heuristic function given below. h(n) 6 . Consider the following graph with start state S and goal state G. The numbers on the arcs indicate the cost of traversing that arc. (a) Seek the best (least cost) path, using uniform-cost search, assuming nodes are considered in top- to-bottom order. (1) List the nodes in the order they would be expanded; at each step, list the nodes (with their path cost) stored in the frontier and the explored set. (2) list the nodes that lie along the final correct path to the goal. (b) Same as (a), but using the greedy best-first search using the heuristic function given below. h(n) 6