End Sorted

Chef considers a permutation $P$ of $\{1, 2, 3, \dots, N\}$ `End Sorted` if and only if $P_1 = 1$ and $P_N = N$. Chef is given a permutation $P$. In one operation Chef can choose any index $i \ (1 \leq i \leq N-1)$ and swap $P_i$ and $P_{i+1}$. Determine the minimum number of operations required by Chef to make the permutation $P$ `End Sorted`. **Note:** An array $P$ is said to be a permutation