2.2 Suppose a problem involves an input array of n elements. There are eight algorithms for solving the problem. Algorithm A performs ti(n) operations, i = 1,2,...,8, [4 marks] ti(n) = 23n tz(n) = yn t3(n) = (log2 n) t4(n) = (n 3)! ts(n) = n! +21 t6(n) = 7 log2 (n +64)4 t7(n) = 3n t(n) = 0.02n4 + 3n3 + 1 Order the functions according to their rate of growth, from the lowest to the highest