Solve for only Number 2 Please, for each letter of a - f

1- Suppose a machine on average takes 10-8 seconds to execute a single algorithm step. What is the largest input size for which the machine will execute the algorithm in 2 seconds assuming the number of steps of the algorithm is T(n) = a. log n n b. C. n d. n2 e. n3 f. 21 2- For the machine in the previous example, how long will it take to run the algorithm for an input of size 1,000, assuming the time complexities from the same example