Question

Q2: Let A[1..n) be an array of n distinct numbers. If i<j and A[i] > A[], then the pair (1,1) is
called an inversion of A. Suppose that the elements of A form a uniform random permutation
of (1, 2, ..., n). Use indicator random variables to compute the expected number of
inversions.​

Answer 1

Answer:

Please see the photo attached by me for help