Let n > 1. Consider the following pseudocode segment. Algorithm 1 Problem 1 1: for i {1,2,..., 10} do 2: statement A; 3: for j {1,2,...,n} do statement_B; for k {1,2,3,4} do for 1 {1,2...,n} do statement.C; (1) How many times does each of statement A, statement B and statement C execute, respectively? (2) Suppose that statement A requires 3n comparison operations, statement B requires na comparisons, and statement C requires 3 comparisons. . How many total comparisons does the entire pseudocode segment require? . What is the complexity of the pseudocode