For each of the following code fragments, provide an appropriate summation expression that models its running time T(n). Then simplify the summation expression to an expression in terms of n, and then determine either a big-O or big- representation of running time T(n). a. sum0; for i-0; i