Inversion Pairs

Given a sequence $S$ = $(s_1, . . . , s_n )$ of $n$ distinct integers, define an inversion as a pair $s_i$ , $s_j$ , $j \gt i$ such that $s_i \gt s_j$ . For example, in the sequence $(2, 4, 1, 7, 6)$ , $2, 1$ is an inversion so is $4, 1$ and $7, 6$. Write a program that finds the number of inversions given a sequence $S$. ###Input: - Sequence of integers separated by a space ###Outpu