For each function $()$ and time $$ in the following table, determine the largest size $$

of a problem that can be solved in time $,$ assuming that the algorithm to solve the

problem takes $()$ nanoseconds. Assume $30$ days in a month.

$5$ seconds $5$ minutes $$

$$ hour $3$ days $2$ months

$$

$$

$$

$$

$!$