3) For each function with input argument n, determine the asymptotic number of "fundamental operations" that will be executed. Note that fd is recursive. Choose each answer from among the following. You do not need to explain your choices. (1)(logn)(n)(nlogn)(n2)(n2logn)(n3)(2n)(n!) a) void fa (int n), for (k=1;k0;i=i2) Perform 1 fundamental operation; //endfor i d) void fd(int n ) \{ if (n>1) i fd(n/3); fd(n/3); fd(n/3)<>