1 Arrange the following expressions from slowest to fastest growth rate. n log2 n 4n k log2 n 5n2 40 log2 n log4 n 12n6 2 Determine the O(_) for each of the following functions, which represent the...

1 Arrange the following expressions from slowest to fastest growth rate. n log2 n 4n k log2 n 5n2 40 log2 n log4 n 12n6

2 Determine the O(_) for each of the following functions, which represent the number of steps required for some algorithm.

(a) T(n) = n2 + 400n + 5

(b) T(n) = 67n + 3n

(c) T(n) = 2n + 5n log n + 100

(d) T(n) = log n + 2n2 + 55

(e) T(n) = 3(2n) + n8 + 1024

(f) T(n; k) = kn + log k

(g) T(n; k) = 9n + k log n + 1000