Select the best answer. Consider this algorithm: a 0 for i 0 to n-1 for j i1 to n-1 a a 1 The objective is to count the total number Tn) of additions performed by the statement a -a+ 1. Four students evaluate T(n) and found these expressions: Student 1: n 1 Student 2: n-i1 Student 3: n3-n) Student 4 (n2-n) s expression is right Check all that apply. Two algorithms A1 and A2 solve the same problem. The running times of algorithms A1 and A2 are T1(n) and T2(n), respectively T (n)0.01n5 T2 (n) 100 n 1g(n) Four students make the following statements Student 1: T1(n) E O (T, (n)) Student 2: T1 (n) E (T, (n)) Student 3: T1 (n) E (Tz (r) Student 4: Algorithm A1 is better than Algorithm A2 Check the students who made true statements. T, left(right)MinThetalleft(T-2\left(nright)right) 23 Check all that apply. Two algorithms A1 and A2 solve the same problem. The running times of algorithms A1 and A2 are T1(n) and T2(n), respectively. T, (n) 6n2 T, (n) n2 lg(n) Four students make the following statements: Student 1: T (n) E O (T2 (n)) Student 2:11 (n) E (T2 (n)) Student 3: T (n) E (T2 (n)) Student 4: Algorithm At is better than Algorithm A2 Check the students who made true statements. Check all that apply. Two algorithms A1 and A2 solve the same problem. The running times of algorithms At and A are T1(n) and T2z(n), respectively. T, (n) = 10 Vnt-lg(n) Four students make the following statements: Student 1: Th (n) E O(T? (n) Student 2: T1(n) E (T, (n)) Student 3: T1 (n) E (T2 (n)) Student 4: Algorithm A1 is better than Algorithm Az Check the students who made true statements