Recall that the time complexity for the selection sort can be defined by the following recurrence equation. . tn = tn-1 + n for n > 1, t = 1 First the closed form solution of the recurrence equations, then give the complexity order of tn. That is, give the value of O(tn). Hint: tn tn-1 + n tn-2 + (n-1) + n = tn-3 + (n-2) + (n-1) + n = .. ti + 2 +3 +4 + + (n-2) + (n-1) + n 1 + 2 +3 +4 + + (n-2) + (n-1) + n ... Oln) Oln logn) O( n^2) None is a correct