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 algorithm to solve the problem takes f(n) milliseconds. (Note: Your response must be in milliseconds, but the book asks for microseconds.)

If your response requires formulas including exponents, please use Python notation. For example, express 3x10³ as 3*10**3 or 3*(10**3).

1. Answer for F: n = ?

2. Answer for G: n = ?

3. Answer for H: n = ?

4. Answer for I: n = ?

5. Answer for J: n = ?

1 second 1 minute 1 hour B lg n A n D E F n G H n lg n ) n2 .