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)

For clarity part (b) is as follows

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 Rubiks cube.