3. In the following graph, the starting node is A and the goal node is H. The values given over the links are the lengths of the links and the numbers written in the nodes are estimations to the goal. a. Using A* algorithm find the path to the destination (show all steps) b. Using Greedy algorithms find the path to the destination (show all steps) C. Explain what is the reason for the differences (if any) in the results of these algorithms A/20 -10 B/12 -12- E/8 C/16 D/9 F/4 -7- G/3 2 13 5- H/O K/9 -5 M/5