(2-3) In sorting n (n > 2) data items using a comparison-based sorting algorithm, if k denotes the number of key comparisons and m denotes the number of data movements incurred from maintaining the order of the data items, then which of the following is/are correct? (A) (n log2n) Sm Sn(n-1)/2 (B)(n-login) Sk Sn(n-1)/2 (C) 0Smsk sn? (D) If m = 0, then k = (n-1) (E) If k = n(n-1)/2, then m = (k-1) (2-4) Given a triangular matrix T of dimension n xn and an array U of m components. U is used to store the non-zero components of T. If T[0][1] is stored into U[0] and T[1][4] is stored into U[n+1], then which of the following is/are true? (A) T is a lower triangular matrix and TC170,0