Ans to The Question No 1 :-


Time complexity of an algorithm signifies the total time required by the program to run till its completion.

Ans To The Questions No 2 :-


There are some bugs in this code.

These are :

In line 3: we have to declare i
In line 6: before counter we have to also put for
In line 14: we have to put ; in last printf (“hello”) ;

In first for loop we can say it’s = 0 (n+1)
Then in 2nd step we see that here is 3 nested for loop so this answer is = n*n*n = 0 (n³) .

Final result is = 0(n+1) + 0(n3) = 0 (n³)

The time complexity is n³.