For following algorithm, write the Recurrence Relation T(n) for its time complexity (show details on the algorithm),solve the recurrence relation only enough to give the theta notation.

DoSomething (A, n)

if (n == 1) return;

else DoSomething(A, n-1);

for (i = 1 to n)

for j = 1 to n

print *;

go to a new line;