Let \( p=p_{1} p_{2} \ldots p_{n} \) a permutation. We say, that \( \left(p_{i}, p_{j}\right) \) on the inversion of the permutation \( \mathrm{p} \), if \( i<j \) but \( p_{i}>p_{j} \).
Find the amount of the inversions of the set \( \{1,2,3,4,5,6,7,8,9\} \) in the permutation \( \{9,7,2,8,3,6,5,4,1\} ? \)
