Problem 3 (10 pts) Use A* search to find the shortest path from D to A, where the heuristic function and edge costs are given by the tables below (a hyphen means you cannot travel directly between cities): Draw the nodes with the following format (description on left, example on right): Do NOT a new node for a location UNLESS its f-value is smaller than the f-values of all nodes with that location already in the tree. PLEASE MAKE YOUR TREE DIAGRAM NEAT