The growth function should include all terms (analysis of algorithms, growth function, asymptotic complexity), the order should be expressed in Big-Oh notation.

EX 11.5 Determine the growth function and order of the following code fragment: for (int count=0; count