4. Consider the following pseudocode. procedure Statements(n > 1) 1, for i := 1 to 10 2. Statement A. for j := 1 to n Statement B. for k:- 1 to 4 4. for l:-1 to n 6. 7. Which statement (A, B, or C) is executed the most number of times? Statement C Suppose that Statement A requires 3n comparison operations, Statement B requires n2 comparisons, and Statement C requires 30 comparisons. How many total comparisons does the entire pseudocode segment require? What is the order of this algorithm in notation