The zigzag array has all distinct values with the first element biggest, second element smallest, third element second biggest, fourth second smallest and so on$.($it is the expected output$)$

$1)$ Please explain why the number of swaps for zigzag arrays of sizes $1$ and $3$ are always $0$ and $2,$ respectively.

$2)$ Consider the zigzag array of size five with values of $[1,2,3,4,5].$ Draw the array before each swap and after the last swap. Include annotations for indexes j$,$ j$+1$ and i$.$