IN C LANGUAGE, no global variables

The Towers of HaHa problem is the same as the Towers of Hanoi problem. However, the disks are numbered 1 through n; odd-numbered disks are red, and even-numbered ones are yellow. The disks are initially on tower 1 in the order / through n from top to bottom. The disks are to be moved to tower 2 and at no time should a disk sit on top of a disk that has the same color. The initial and final disk orders are the same. Write a program to move the disks from tower 1 to tower 2 using tower 3 for intermediate storage. Base it on the recursive Towers of Hanoi below, but make the necessary changes required by the Towers of HaHa. The code should remain recursive