1. 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) microseconds (10 of a second). We will also assume that there are 30 days in a month and 365 days in a year. 1 minute 1 hour 1 day 1 month 1 year 1 century fin) logan 1 second 21(10) 1012 106 6x107 3 6x108 864x1082592x109 31536x109 31536x1011 n2 10 102 n3 an 102 20 2n 1. 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) microseconds (10 of a second). We will also assume that there are 30 days in a month and 365 days in a year. 1 minute 1 hour 1 day 1 month 1 year 1 century fin) logan 1 second 21(10) 1012 106 6x107 3 6x108 864x1082592x109 31536x109 31536x1011 n2 10 102 n3 an 102 20 2n