Problem 4: Suppose we have the following problem which is called Towers of Hanoi. Initially, the disks are placed in decreasing size on support 1, and the objective is to move them to support 3. The conditions for moving the disks are: (20 points] o all disks (except the one to be moved) have to be on one of the three supports; o it is possible to move only one disk at a time, taking it from the top of the tower on one of the supports and placing it on the top of the tower on another support; o a disk can never be placed on a smaller disk. The initial state and the final state for a set of 3 disks are shown in the following figures. Tower Of Hanoi o a disk can never be placed on a smaller disk. The initial state and the final state for a set of 3 disks are shown in the following figures. Tower Of Hanoi Tower Of Hanoi Start State Goal State Use A* algorithm to find the path from start state to the goal state