Sort Permutation

You are given a permutation $P$ of length $N$. You can perform the following operation on $P$: - Select two **distinct** indices $i$ and $j$ $(1\le i, j \le N)$ and **swap** the elements $P_i$ and $P_j$. - The cost of the operation is $abs(i-j)$. The total cost is defined as the sum of costs of all operations performed. Find the **minimum total cost** to sort the permutation in increasing order