Please help me to solve these problems(Algorithm)

Thank you very much

For each function of time 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 1 microseconds for each input. According to the function of time, which time complexities are in Polynomial Class and which are in Exponential Class Find the running time of Insertion Sort where the input are (5, 2, 4, 1, 3), (1, 2, 3, 4, 5), (5, 4, 3, 2, 1), (1,1,1,1), (5,2,3), respectively