For each function fln) 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 fln) 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 3x103 as 3*10*3 or 3(10**3). 1 second 1 minute 1 hour ign A Vn D B C E F n G nign J n2 M n3 P 2n S OZ*I T U n! V W X