2) For each function with input argument n, determine the asymptotic number of "fundamental operations" that will be executed. Note that fc 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) l for (i=1;i1) i fc (n/2); fc (n/2); Perform 1 fundamental operation; H/lendif \} d) For part d), a fundamental operation will be a comparison of array element types. void hybridsort(element a[], int n ) \{ // Put a[0]a[n1] into ascending order. if (n<>