I need Help with my AI HW please

1. Heuristic Search (18 points) Consider the graph below. The start state is S and the goal state is Z. The numbers on the arcs indicate the cost of traversing that arc. In addition, when applying a search algorithm to this graph, note that: each node should be expanded at most once; if needed, break ties alphabetically whenever the search algorithm requires a heuristic estimating function, use the function h defined below the graph. S A B C D E FG2 h(n) 8765 4 3 210 (a) (6 pts) Using the graph above and uniform-cost search: (b) (6 pts) Same as (a), but using greedy best-first search: ii. List the nodes that lie along the final path to the goal (e.g. S, A, E, G, Z): (c) (6 pts) Same as (a), but using A search