An algorithm with one positive integer input n has runtime O(n^2) (read: O n squared) in big O notation. Identify all of the following three statements that could be true. 1) The runtime decreases as n increases when n is less than a hundred 2) The runtime goes to a constant as n goes to infinity 3) Whenever n increases by 1, the runtime doubles