Let A[1...n] be an array of n distinct numbers. If i < j> A[j], then the pair (i, j) is called an inversion of A. What is the expected number of inversions in any permutation on n elements ?
Answer: B
No answer description available for this question.