3) For each function with input argument n, determine the precise number of fundamental operations that will be executed. Your answer should be a function of n in closed form. Note that closed form means that you must resolve all s and s. An asymptotic answer (such as one that uses big-oh, big-theta, etc.) is not acceptable. Assume that n 1 for all parts. Note that fc is recursive. This problem asks for the exact count of fundamental operations, but for this class, also give a good Big-Oh O bound.

a) void fa (int n) l for (int i = 0; i = n; i = i+2) Perform 1 fundamental operation; //endfor i b) void fb (int n) i for (int j //endfor j for (int k = 2; k = n; k++) 1, j n; j++) Perform 1 fundamental operation; //endfor k