For the following pseudo-codes, what is the time complexity function (T(n)) and the order ()? You can ignore the overhead operations and just count the basic operations.

(a) j = 1 ;

while ( j <= n/5) {

i = 1 ;

while ( i <= j ) {

cout << j << i ;

i++;

}

j++;

}

(b) int F1 (int n)

{ if (n>1)

{

return 2*F1(n-1) + (n-1)*(n-1);

}

}

(c) int F1 (int n)

{ if (n>1)

{

return F1(n-1) + F1(n-1)+ (n-1)*(n-1);

}

}