Consider an array of n entries, where n is a positive integer. Each entry is chosen uniformly randomly from {0, . . . , 9}. We want to sort the array. For example given the array, A = [0, 5, 2, 3, 6, 9, 7] After sorting it looks like, A = [0, 2, 3, 5, 6, 7, 9] Let i be the first index of 3 in the array A before sorting. Let X be a random variable which is equal to the index that the ith entry has been moved after sorting. (a) Calculate E[X]. (b) Calculate Var(X).