Given an array A = [a_1,...,a_n] and a key x. Assuming that Pr(x = a_i) = 1/3^i, forall_i. Based on the number of comparisons between x and A[i]'s, compute T_a(n) in closed-from if the sequential search algorithm is used for search for x in A (starting at A[1])