Question 4: (max. 20 mins.) [10] Construct the tree diagram and also write the steps in sequence for 4 disks tower of Hanoi problem. Algorithm: Tower (N, A, B, C) 1. IfN = 1 then a) Move Nth from A -> b) return 2. Else: a) Tower (N-1, A,C,B) b) Move Nth from A-> c) Tower (N-1,B,A,C) d) Return