5. [9 marks] Order Notation. In this question we consider algorithms A, B with runtime functions a(n),b(n). For each of the following three scenarios, indicate whether the claim is true or false, and give an informal argument to support your answer. a. [3 marks] If a(n) = 2n Vn and b(n) = n2.5, then a(n) O(b(n)). b. [3 marks If a(n) = 3n2 + 5n and b(n) = 2n2 7n, then an) e (6(n)). c. [3 marks If a(n) = n. log n and b(n) = 100n, then a(n) e (b(n))