show working for each please

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. Case(3) with f(n)=n has already been shown for your reference. You should provide your answer in the above space (or below) in either of the following standard formats: e.g. 4.51E7(=4.51107), or 2(3.24E5), or just as an integer. You must also show your workings for each of the above solutions a-h, in the space given below. Part d above has higher weightage and if you have written code to solve this part, please paste a copy of your code