Q2. (a) Write the following (jumbled) functions in order of increasing computational complexity: n, n, 2n, logn, n, n logn, 3n, log logn, n2" [11 marks] (b) If f(n)(g(n)) and g(n) (h(n), use the definition of "big notation to prove [10 marks] c) Suppose that algorithms Al and A2 have computational complexities of O(n log(n)) and O(n) respectively. Both algorithms take approximately 100 seconds to run on data input of size n- 10,000. Determine (to the nearest second) the time it will take each algorithm that f(n) 2g(n) + h(n) -O(h(n) to run on data input of size i. n 1,000 11. n= 100.000 [12 marks