00:01
Hello students.
00:02
So, let us look at this question.
00:04
So, for question number 5, the approximation for the first one would be n, the second one would be 1 by n square, third one would be 1, fourth one would be 15 n cube and e1 that is last one, fifth one it would be again 1.
00:27
It was for question number 05.
00:31
Now, coming on question number 06, the order of growth would be o of n or we can say 0 of n, actually it is 0 of n.
00:42
So, order of growth is equal to 0 of n.
00:50
Now, for question number 07, the formula for running time they are asking.
00:57
So, the formula to predict the running time of program for a problem of size n when doubling the experiment have shown the doubling factor which is 2 raised to the power d and the running time for problems of size n0 is t.
01:11
So, the formula can be written as predicted, the formula would be predicted running time which is equal to t then multiply by 2 raised to the power log 2 n minus log 2 n of 0...