Answer Happy

Choose the correct worst case, tightest bound, running time of the following pseudocode Big-Oh notation in terms of the variable n. for (i=0; i<n?; i++) print "H"; j=1; while (j<n3) for (k = 1; k<j; k=8k) print "H"; H j=5j; for (t = 0; t<5%; t=9t) print "H";