1. (10 points) Suppose A(n) is an algorithm whose input is integer n and whose run time aber of steps required for inpuit (measured by the number of steps required for input n) is T(n). Suppose T(n)-O(n2). (a) (5 points) What does this say about the worst case run time of algorithm A? (b) (5 points) What does this not say about the worst case run time of algorithm A