3. This question is to give one an idea of the rate at which functions grow. For each function f (n) and time t in the following table, determine the largest size n of a problem that can be solved n time t, assuming that the algorithm to solve the problem takes f (n) microseconds. Note that log n means the logarithm in base 2 of (5 pts.) n. Some entries have already been filled to get you started 1 Second Hour 1 Month 1 Century log n ~10300000 n log n n2 2" 20