in how large an input n can be calculated, given each of the runtimes given along the top filled hat a program runs in f(n) microseconds, where f(n) is the function given on the left. Fill . I have in two values for you. You do not need to fill in every box, but should have at least of every row filled in, and at least half of the rows complete second minute hour day month year Tt Tt nIgn TI 29 1000 Show some calculations, or some of your code if you use code to get answers. Which row is the most sucktastic one to compute? Why? Do you have any non-integer answers? 2. Find a simple formula for i(2k-1). Prove your answer. 3. Evaluate the product lr_1(#/2). Prove your answer. 4. Give an asymptotically tight bound for where r 20 is a constant