Example $1$:

Input: L $=12,11,13,5,6$; N $=1$

Output: $11,12,13,5,6$

Explanation:

Step $1$: Sort this array and record each step of transformation:

$[12,11,13,5,6],[11,12,13,5,6],[11,12,5,13,6],[11,5,12,13,6],[5,11,12,13,6],$

$[5,11,12,6,13],[5,11,6,12,13],[5,6,11,12,13]$

Step $2$: Select the output at N$=1($i$.$e$.,$ what does the array look like after the first

transformation$)$: $[11,12,13,5,6]$

Note: For the original array $[12,11,13,5,6],$ you need to use the insertion sort to finally

turn the array into $[5,6,11,12,13].$ If you correctly apply the algorithm, it would take a total

of $7$ steps to transform the original array to get the desired outcome.