1. (25 points) Assume each expression listed below represents the execution time of a program Express the order of magnitude for cach time using big O notation. a. T(n) = ns + 100n . log2 n + 5000 b. T(n) = 2" +n + 7 d. T(n) 1+2+4+2 2 (75 points+5 extra credit) For cach of the code segments below, determine an equation for the worst-case computing time Tn) (expressed as a function of n, ie. 2n+4) and the order of magnitude (expressed using big O notation, ie. O(n) a. 1/ Calculate nean sum 0; cin >> x; while (x --999) sum+X cin > nean-sum 2. (continued) (75 points) For each of the code segments below, determine an equation for the ie, 2n + 4) nd the order of worsl-case computing time TR, (expressed as a functon of magnitude (espressed using big O notation, Le. Om b. I/ Matrix addition for (int i-0; i -1) f. (extra credir-5 points for (int-1: Cn-: 1) for lint- cout ce