DATA STRUCTURES (just 3.1-2 and 3.1-4)

810) 3.1-2 Show that for any real constants a and b, where b>0, (n + a)" = O(n) (3.2) 3.2 Standard notations and common functions 53 3.1-3 Explain why the statement, "The running time of algorithm A is at least O(n2)," is meaningless. 3.1-4 Is 2n+1 = 0(2")? Is 22n = 0(2")