Prob 1. You are given a. tower of 'n disks, initially stacked in decreasing size on one of three pegs. The objective is to transfer the entire tower to one of the other pegs, moving only one disk at s time and never moving a. larger one onto a. smaller. How many moves are necessary and suteient to perform this task? Find a formula for the necessary and suicient number of moves and prove it by induction