O b te pseudo Due, a) Measure the actual running time, f(n), of th cost of each statement multiplied by the number of times the b) Drive the asymptotic running time leading term. me, f(n), of the MERGE-SORT algorithm with a summation of the plied by the number of times the statement is executed. Inning time, g(n)-0, by dropping lower terms and ignoring constants in MERGE-SORT(A, p,r) if p