Given the function T(N)=2N+3N2+5 is the worst case runtime for a function. Which of the following would be a known tightest bound? The function is O(n2). The function is (n2). The function is (n2). The function is O(n). Given the choice of four algorithms that perform the same operation with the below Big-O complexities, which of the four would be preferred? O(n) O(n2) O(n+lg(n)) O(lg(n))