Look at the pseudo code below and find the Big O estimate or worst case complexity of the following functions. int fun(int N) { for(i=0;i0; i--) { for(j=0;j

} int fun(int N) { for(i=N;i>0; i=i/2) { j=1; while(j0) { j=1; while(j