### Big-O Big-Theta

Given the algorithm below, suppose the number of times the "beep" instruction is executed is f(n). Choose all true statements below, and no false ones... for i := 1 to n for j : = 1 to i for k := 1 to 18 BEEP next k next j next i a. f(n) is big-Theta (n^2) b. f(