Derive an exact closed form bound in terms of n on the number of times function F called in each code segment. Use floor/ceilings as needed. Clearly explain your answer and show your work.

(c) The initial call is F(n2). \begin{tabular}{lc} \hline \hline 1: & function F(i) \\ 2: & if i1 do \\ 5: & ii/4 \\ 6: & F(i) \end{tabular}