1) Implement the base case for the towersOfHanoi() function, where the number of disks to be moved is equal to 1. (1 pt) 2 Implement the recursive case for the towersOfHanoi() function, where the number of disks to be moved is greater than 1. (3 pts) LARVITY 10.10.1: Ch10 - LAB: Towers of Hanoi 0/40 main.c Load default template... #include 3 void towersofHanoi(int n, char From_post, char to_post, char aux_post) { if (n == 1) { // FIXME: Base case - print a message to move disk from the from_post to the to_post else { 00 OOM 1/ FIXME: Recursive case - call towersofHanoi( to move n-1 disks from the from_post to the aux_post, // then print a message to move disk from the from post to the to_post, // then call towersofHanoi() to move n-1 disks from the aux_ post to the to_post, return; 18 int main(void) { int numisks; NNNNN printf("Enter number of disks: "); scanf("%d", &numDisks); printf(" "); towersofHanoi (numDisks, 'A', 'C', 'B')