Please answer all questions

classtest1.pdf t En) 20:41 1 of 166.309 Thumbnails 2 Complexity - 15 marks 1. Are the following statements true or false? Prove your answer (a) It is possible for a function in O(n) to be in (n2) 13 (b) 2n314n2 1 E S(n) [3] (c) O(3) c(2 13 (d) The worst case of an algorithm runs in O(n2) time. It is possible for the algorithm to rurn in O(n3) time. [3] 2. You have a task to perform. If you perform the task on an unsorted array, it wil take (n2 time. However, if you perform the task on a sorted array, i takes (nlog(n)) time. If you are given an unsorted array as input, how would you perform the task as efficiently as possible? Explain your answer. [3