$1-1$ Comparison of running times

For each function f $.$n$/$ and time t in the following table, determine the largest

size n of a problem that can be solved in time t$,$ assuming that the algo