Code using Python 3.9

2. The Hofstadter Female and Male sequences are recursively defined as shown here. Write a recursive function for each. Then write a main program that prints out the first 30 of each sequence. The Hofstadter Female (F) and Male (M) sequences are defined as FO)=1; M(O) = 0 F(n)= n - M(F(n-1)), no M(n)=n-F(M(n-1)), n>0. The first few terms of these sequences are F: 1,1,2,2,3,3,4,5,5, 6, 6, 7, 8, 8, 9, 9, 10, 11, 11, 12, 13, ... / M: 0, 0, 1, 2, 2, 3, 4, 4, 5, 6, 6, 7, 7, 8, 9, 9, 10, 11, 11, 12, 12