3 (CLRS 5.2-5) Suppose a permutation is generated uniformly at random. That is, you start with the sequence 1, 2, . . . , n, and you randomly shuffle to obtain the sequence i1,i2,... ,in. For example, if n -4 you start with 1,2,3,4 and it is possible to permute this list to obtain 2,1,3,4. An inversion is a par (j,k) where j k but ij . In the above example, (1,2) is an inversion of 2,1,3,4 because 2 appears before 1. Use the indicator random variables Xij to indicate that (i,j) is an inversion to calculate the expected number of inversions 3 (CLRS 5.2-5) Suppose a permutation is generated uniformly at random. That is, you start with the sequence 1, 2, . . . , n, and you randomly shuffle to obtain the sequence i1,i2,... ,in. For example, if n -4 you start with 1,2,3,4 and it is possible to permute this list to obtain 2,1,3,4. An inversion is a par (j,k) where j k but ij . In the above example, (1,2) is an inversion of 2,1,3,4 because 2 appears before 1. Use the indicator random variables Xij to indicate that (i,j) is an inversion to calculate the expected number of inversions