For the below pseudo-code,

(a) Find the closed form expression (i.e. without summations) for the worst case run time, T (n), as a function of n. The cost of the function Boo on an input A of size n, Boo(A, n), is n log n.

(b) Next, give the the asymptotic time complexity of T (n) in terms of the best Big-Oh.

Pseudocode:

Approx(A, n) // the input is an array of size n

{

for i = 0 to (n-1) {

for j = i to (n-1) {

print *

}

print new line

Boo(A, n)

}

}