Consider a Tower of Hanoi problem with four poles, where the poles are located at the corners of a square. We will call the poles A, B, C, and D (in a clock-wise order). Rules are the same, but with one additional requirement: disc can be moved from a pole only to the poles that are located at adjancent corners (for example, a disc from A can be moved either to B, or to D: not to C). Design a recursive algorithm that will move a tower with n discs from A to B