PYTHON CODE

Q3: Hofstadter Sequences - 15 pts The Hofstadter Female (F) and Male (M) sequences are mathematically defined as: F(0) = 1 M(O) = 0 F(n) = n - M(F(n-1)), for n > 0 M(n) = n - F(M(n-1)), for n > 0 In all cases, assume n is an integer. The first few terms of the sequences are as follows (for n = 0, 1, 2, ...) F sequence: 1, 1, 2, 2, 3, 3, 4, 5, 5, 6, 6, 7, 8, 8, 9, 9, 10, 11, 11, 12, 13, 13, ... M sequence: 0, 0, 1, 2, 2, 3, 4, 4, 5, 6, 6, 7, 7, 8, 9, 9, 10, 11, 11, 12, 12, 13, ... Open Hofstadter.py and implement the two functions hof_F and hof_M: hof_F(n): takes as input integer n and returns the result of F(n) hof_M(n): takes as input integer n and returns the result of M(n) The return value of each function should be an integer (not the whole sequence). def hof_F(n): # Implement Hofstadter's Female sequence here return -1 def hof_M(n): # Implement Hofstadter's Male sequence here return -1 def main(): You can test your functions using the function calls below. Uncomment to use them. When submitting, make sure you submit a version that does not contain syntax errors. M_results = [] F_results = [] for i in range(0, 50): M_results.append(hof_M(i)) F_results.append(hof_F(i)) print(F_results) print(M_results) DO NOT EDIT BELOW THIS LINE if __name main() '__main__