(10 pts) For each function f(n) (the row index in the following table) and time t (the column index in the following table), determine the largest size n (which should be an integer) of a problem that can be solved in time t, assuming that the algorithm takes f(n) milliseconds to solve an instance of a problem of size n. Fill the value n in the corresponding entry. Note that n has to be an integer. Assume that there are 30 days in a month. 1 second | 1 minute | 1 hour| 1 day | 1 month 30 log2 n n2 + 2n 2" n