2. (10 points) Consider the following algorithm procedure Loops(n: a positive integer) I. for i:= 1 to n 2, for j := 1 to i 3. rint floor(i/j) (a) Write what the algorithm prints when n 5 (b) How many times does print routine get called when n = 5? (c) How many times does print routine get called for an arbitrary n