For each problem, make sure to rewrite the asymptotic notation to whatever the expression is defined to be mathematical, by spelling out the definition. Also keep in mind that you need to provide, whenever applicable, concrete constants and n₀ when proving an assertion or a counterexample when disproving an assertion.

Thank you!!

3.13 Explain why the statement, "The running time of algorithm A is at least O(n2)," is meaningless. 3.14 Is 2n+1=O(2n) ? Is 22n=O(2n)