Write a reccurence for the time complexity, then solve the recurrence

Just b please

void martha(int n)

2. For each of the recursive sulprograms, write a recurrence for the time complexity, the solve that (a) void george(int n) (11n > 0) (for(int i0; 1) (aartha(-1); martha (n-2): >> Hint: Look at problem 0.3 on page 9 of your textbx