By using which method sorting is not possible Select one: a. Insertion O b. Selection O c. Deletion O d. Exchange h Considering the following recursive time, compute the final T(n) and T(n) complexity using forward or backward substitution. T(n)=2 when n=1 T(n)= T(n-1)+2 when n>1 Select one: O a. T(n) = 2n+2, O(n) O b. T(n) = 2n, (2n) O c. T(n) = 2n, O(n) d. T(n) = n, on)