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])/(i+1);

} } Assume that the function random has a complexity of O(n) void fun(int array[], int a, int b) if a > b return; mid= (a+b)/2; fun(array, a, mid); fun(array, mid+1, b); random(array, a, mid, b); int fun(int x, int n) { if(n==0) return 1; if(x==0) return 0; if(n==1) return x; if (n%2==0) return fun(x*x, n/2); else return x*fun(x*x, n/2); }