Q6. For each of the following program fragments, provide the big-0 bound of its running time. (What is a sensible measure of the problem size here)? For each problem, provide a brief justification of your answer. a) 2P. sum = 0; for (i = 0; i <>