Implement a version of the towershanoi procedure that uses three arrays each of n elements to solve the problem for n disks. If the disks are labelled 1 through n with the largest diameter disks being n. the contents of the three arrays after each transfer should reflect the corresponding status of the 3 poles. Incorporate a suitable printout that reflects the status of the poles after each transfer.