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 disc 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 The Towers of Hanoi h(x)= (the total number of disks of left and middle poles) + 2% (number of 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 (3pts) Build the search tree. . 2ps) Solve the search problem by using if the real cost is R(n) = 1# of dirty palaces. 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 disc 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 The Towers of Hanoi h(x)= (the total number of disks of left and middle poles) + 2% (number of 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 (3pts) Build the search tree. . 2ps) Solve the search problem by using if the real cost is R(n) = 1# of dirty palaces