comparison of running times

For each f(n) and time t in the in the following table, determine the largest size n of a problem that can be solved in time t, assuming that the algorithm to solve the problem takes f(n) microseconds

1 second 1 minute 1 hour 1 day

lg n

diye bi sorum var
nasıl cözebilecegimi anlayamadım yardımcı olursanız sevinirim