Computer Science - Asymptotic Notations

= (a)(4 points) Which one of the following is true? Justify your answer. Hint: O(n) +1(n) = O(n) implies O(n) UN(n) C O(n). 1. Q(n) + 2(n) = P(n) 2. P(n)+P(n) = 2(n) 3. en) + 2(n) = P(n) 4. f(n) = 0(g(n)) implies g(n) = O(f(n)) = (b)(4 points) Which one of the following sorting algorithms will have the best worst-case running time? Justify your answer. 1. Selection sort 2. Insertion sort 3. Heap sort 4. Quick sort (c)(4 points) Explain why the statement, The running time of an algorithm is 0(00), is meaningless