Q1: (50points) (a) A technique that can be used to describe the running time of an algorithm is known7 as asymptotic notation. One form of this technique is known as "Big- Oh" notation Give the definition for this notation (b) In the following, use either a direct proof (by giving values for c and no in the4 definition of big-Oh notation) or cite one of the rules given in the lectures, to show that 5(n + 2)" + 2n log n + n2 + 5 is O(n6) (c) What is the running time complexity of the following functions? (a) 2n2 +3n +4 (b) 24n log n +12 +12 (c) (n2-n)(n2 + n) (d) n2" 62" (e) 6n3(1 +log n) (3 3 (3 (3 3