What is the worst case running time of the following pseudocode functions in Big-Oh notation in terms of the variable n. (from the listed choices choose the tightest possible answer).
for (k=0; k
{
for (i=0; i
{
System.out.println("k="+k);
}
for (j=n*n; j>0; j--)
{
System.out.println("k="+k);