Data structure and algorithms

1. Order the following functions from slowest growing to fastest growing by inspecting their graphs. a. T(n) = n b. T(n) = 1 c. T(n) = sqrt(n) d. T(n) = n2 e. T(n) = log n Answer The order is from the slowest growing to ...