Here are two recursively defined functions. Finish the attached program by coding the two functions F and M. Right now they just return 0.

F(0)=1

M(0)=0

F(n)=n-M(F(n-1)),n>0

M(n)=n-F(M(n-1)),n>0

#include

int M(int);

int F (int n) { return 0; }

int M (int n) { return 0; }

int main() { int i; for (i = 0; i < 20; i++) { printf("F(%d) = %d ", i, F(i)); } for (i = 0; i < 20; i++) { printf("M(%d) = %d ", i, M(i)); } return 0; }