2.

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 lood we can say it's =o(n+1)

the in 2nd step we see that here is 3 nested for loop so this is =n*n=0(n2)

final result is =0(n+1)+0(n2)=o(n2)

Time complexity is - n2.

1.Time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.