QUESTION No 3: MANDATORY/DOPTIONAL/ BONUS (5 POINTS) Consider that we have a tower of Hanoi problem, and we went to move the discs from pole A to pole C. You can move one dise only in each step. The big disc is never be inserted above the small disc. The real cost g(x)=depth of the node, and h (x)= (the total number of disks of left and middle poles) + 2* number of The Towers of Hanoi disks that in the right pole and smaller than any disk that in left or middle poles ) used the above information to find No repeated states pts Build the search tree. (2pts Solve the search problem by using A* if the real cost is R(n) = 1/# of dirty palaces