4. Consider the following pseudocode. procedure Statements (n > 1) 1. for 1 to 10 Statement A. for j1 to n 2. 3. 4. Statement B. 5. for k1 to 4 6. for 1 to n 7. Statement C. Which statement (A, B, or C) is executed the most number of times? Suppose that Statement A requires 3n comparison operations, Statement B requires n 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?