Q2 For each algorithm below, find a order for the number of times the "beep" command is executed Choose from these: (n") for an integer m; (2"); (ln(n)). Assume a positive integer value is loaded into variable n. (a) Algorithm: for i := 1 to n2 for j := 1 to n for k := 1 to n beep next k next j next i (b) Algorithm: while n >1 n:=ndiv 2 beep end while