For each of the program fragments below, compute the complexity T(n) as a precise count of basic operations. After that,

[answerhappygod]

For each of the program fragments below, compute the complexityT(n) as a precise count of basic operations. After that, state whatthe algorithm is big Oh or big Theta of. Provide separate best caseand worst case scenarios when appropriate.
a.
b.
c. Consider n = a.length.
For each of the program fragments below, figure out the totalnumber of iterations for the loops involved. Use that informationto state what the algorithm is big Oh or big Theta of.
a.
b.
c.
d.