[25marks] 5 marks 1. a) How do heurisitcs improve upon blind search as a means of finding solutions to complex problems? Briefly comment on two problems associated with the use of heuristic search techniques and particularly associated with greedy best-first search. b) How would you go about the challenge of creating just a heurisitc function (only) for the Rubik's cube? Describe how you would represent each state of the Rubik's cube. 5 marks 10 marks c) Describe how you would use the A* search algorithm to find solutions to the Rubiks cube. You can assume that a suitable heuristic function exists such as the heuristic you described in (b) above. 5 marks d) Consider the following MiniMax tree. What score is associated with each of the internal nodes (from within the range A to L)? What node is ultimately chosen as the next move from A and what is its heuristic value? B D E=17 F=-9 K=11 G=5 H=7 J=9 M=8 N=2 P=-16