Question: Suppose algorithms A and B require respectively n2 and 2n steps for an input of size n. For a machine that can perform 10' floating point operations per second (I Giga FLOP), calculate the largest input which A and B can solve within I second, 1 hour, 1 year, l century, etc. (Recall that 210 is approximately 103, I day approximately 8 x 104 seconds, 1 year approximately 3 x 107 seconds, and the age of the universe approximately 13 billion years.)