Dearrange sorting

You are given a permutation $P$ of length $N$. A permutation of length $N$ is an array where every element from $1$ to $N$ occurs exactly once. You must perform some operations on the array to make it sorted in increasing order. In one operation, you must: - Select two indices $L$ and $R$ $(1 \leq L \lt R \leq N)$ - Completely *dearrange* the subarray $P_L, P_{L+1}, \ldots P_R$ A dearrangement o