[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) = 2nVn and b(n) = n2.5, then a(n) (6(n)). b. [3 marks If a(n) = 3n2 + 5n and b(n) = 2n2 7n, then a(n) O(6(n)). c. [3 marks If a(n) = Vn-log n and b(n) = 100, then a(n) (6(n))