Question#2: Calculate T(N) for following code using Frequency Count Method. Represent the time complexity as O(), (), () also (without proving mathematically).

int main()

{

int q=0;

x=func(a,b,c);

if (x>=0)

{

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

{ cout<

}

else

{

for(int j=n;j>0;j/4)

{cout<

}

for (int m=1; m

{

q+=m;

cout<

}

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

{

//do something

for (int p=0; p

{

//do something

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

{

//do something

} } } return 0; }