Expected Value, Linearity & Advanced Probability · Hard problem

A permutation of $1,2,\dots,10$ is chosen uniformly at random. Find the expected number of inversions (pairs of positions $i<j$ with the value at $i$ larger than the value at $j$).

The answer is a fraction $\tfrac{m}{n}$ in lowest terms; find $m + n$.