This question deals with complexity. (a) Part (a) [2 MARKS] Compute and classify (in terms of big-O) the best-case time complexity for the following b) Part (b) [1 MARK] Evaluate the following statement (True or False): n+12n2+3n​∈Ω(n) (c) Part (c) [2 MARKS Explain why the following statement is true by writing a sketch of the proof: n!∈O(nen) where e is the basis of natural logarithms