s=1; for (int i=0; i 100) s=s+7; else { s-=3; s=s*2; } Compute the best and worst time complexity

s=1;

for (int i=0; i

for(int j=0; j < n; j++)

for(int k=0; k < n; k++)

s+=i+j-k;

if (s>100)

s=s+7;

else {

s-=3;

s=s*2;

}

Compute the best and worst time complexity