Computer Science Question:

Please make sure it's clear and understandable. Also please show a screenshot of the code so I can identify the indentation. If it's good, I will give thumbs up 100%!

You are given 3 towers/pegs/poles and n disks of different sizes. All disks are initially on pole A in the ascending order (smallest one on top). Write code to print all the single disk moves required to move all the disks from pole A to pole C while satisfying the following rules (15 marks): . Only one disk can be moved at a time. A larger disk cannot be placed on a smaller disk at any time. . Each move involves taking a disk at the top of any pole and placing it at another pole. input: n output: Movements (one per line) (source pole] to (destination pole] sample: input: 3 output: OOT AC 2 A to B Ic to B | A to c to A 6 B to C A to C