(i) The time complexity of an'algorithm gives an indication of the amount of time the algorithm will take to run completely. (a) Is the time complexity of an algorithm based on the best-case or the...

Show all working explaining detailly each step

Answer b & C

Extracted text: (i) The time complexity of an'algorithm gives an indication of the amount of time the algorithm will take to run completely. (a) Is the time complexity of an algorithm based on the best-case or the worst-case scenario of the Algorithm? (b) Give the tight upper bound for the algorithms with the following time functions. Use the big O notation for your answers. 1. n°+3n+1 2. 2n + logn 3. n+n'+2" (c) Which of the algorithms in (i)(b) is most efficient?