Write a recursive MATLAB program:

We consider the Towers of Hanoi" problem with n = 7 disks of different sizes and 3 pegs (or towers, labeled A, B, C) is described on the Wikipedia page http://en.wikipedia.org/wiki/Towers.of Hanoi. Write a recursive MATLAB program to determine the sequence of moves to bring all disks to peg C starting with all disks at peg A, given the fact that (a) only one disk can be moved at a time and (b) a larger disk cannot be on top of a smaller disk After each move record the position for each disk by the peg it is located at. The starting position is AAAAAAA (from smallest - top on the left to largest bottom on the right), and the last position is CCCCCCC. Determine the sequence of moves (i.e. a sequence of 7-letter strings)