2. Consider the following recursive procedure for the Towers of Hanoi problem. procedure towers (n, frompeg, topeg, auxpeg) if n= 1 then write (move disk 1 from peg, frompeg, 'to peg', topeg) else towers (n-1, frompeg, auxpeg, topeg); write ('move disk, n, frompeg, frompeg, topeg', topeg); towers (n - 1, auxpeg, topeg, frompeg) endif Show the tree structure and the output of the program when (3, a, c, b) is called. (Note that the program may also be written as follows: procedure towers (n, frompeg, topeg, auxpeg) if n> 1 then towers (n - 1, frompeg, auxpeg, topeg); write (move disk, n, frompeg, frompeg, topeg', topeg); towers (n-1, auxpeg, topeg, frompeg) endif