Give the order of magnitude () for the following algorithm. Explain why your answer is correct. GET VALUES for A1, A2, ..., An, and B, B2, ..., Ba Get value of n /* set i equal to 1 */ /* for each of the n values in A */ /* set j equal to 1 */ DO WHILE (jn) /* Do n times */ IF Ai Bj THEN PRINT "Found it!" j=j+1 /* increment j */ /* increment i */ i=1 DO WHILE (in) j=1 END DO WHILE i=i+1 END DO WHILE O (1 mark) Explain what the algorithm does.