1. How can we modify almost any algorithm to have a good best-case running time? 2. Write True/False and justify your answer: a) 1000n+32=O(n) b) 1000n+32=(n) c) 1000n+32=(n) d) 1000n+32=o(n) e) 1000n=O(n2) f) 1000n=(n2) g) 1000n=(n2) h) 1000n=o(n2) i) 1000n2+2n=O(n2) j) 1000n2+2n=(n2) k) 1000n2+2n=(n2) 1) 1000n2+2n=(n2)