What's the right answers? Includes all the steps

Problem 1) Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n 2 steps, while merge sort runs in 64n lg n (i.e, log in base 2) steps. For which values of n does insertion sort beat merge sort? Problem 2) Comparison of running times 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 (lg indicates log in base 2): second minute hour day month yearcentury lg n 7l nlg n 2 2