Question 3 Heuristic Path Search for the 15-Puzzle In this question you will be exploring the Heuristic Path Search algorithm discussed in the Week 4 Tutorial. Draw up a table in the following format: 2-1m- The top row of the table has been lled in for you (to save you from running some rather long computations). (a) Run [greedy] for start50, start60 and start64, and record the val- ues returned for G and N in the last row of your table. Remember to use the Manhattan Distance heuristic dened in puzzle 15.pl (not the Misplaced Tile heuristic from the previous question). (b) Now copy idastar . pl to a new le heuristic .p1 and modify the code of this new le so that it uses the Heuristic Path Search algorithm discussed in the Week 4 Tutorial Exercise, with w = 1.2 . In your submitted document, briey show the section of code that was changed, and the replacement code. (c) Run [heuristic] on start50, start60 and start64 and record the values of G and N in your table. Now modify your code so that the value of w is 1.4, 1.6, 1.8; in each case, run the algorithm on the same three start states and record the values of G and N in your table