1. (5 points each) Look at the pseudo code below and find the Big O estimate or worst case complexity of the following recursive functions. Hint: Write recurrence relation for the functions and solve it using Master theorem. void fun (int n, int m) { if (m > n) return; System.out.print ("m = "+m); fun (n, m+2); } float fun(int a[], int i) { if (i==0) { return a[0]; } if (i>0) { return (i*fun(a, i-1)+a[i])/(1+1);