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 disc only in each step. The big dise 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. B (2pts Solve the search problem by using A* if the real cost is R(n) = 1/# of dirty palaces. AAO-PIO-R01 3 30/9/2018 Page 4 of 6 7/{ FACULTY OF ENGINEERING & INFORMATION TECHNOLOGY DEPARTMENT OF COMPUTER SYSTEM ENGINEERING 11 QUESTION NO 4: MANDATORY OPTIONAL/BONUS (7 POINTS) Consider the unit shown in Figure. Suppose that the weights corresponding to the three inputs have the following values: Initial weights: 0.5.0.75, 0.25 Activation Function: f = 1.25*out Input data: xl x2 x3 12 frue 1 2 3 1.5 2.5 4 13 Apply Process of neural network to this example for 1 iteration if the T = [2.9 1.81 12 N