Problem $1.$ Let's say that we call quichsort $(1,10),$ where $S$ is the array below.

Update what $S$ looks like after every exchange is made and circle the numbers that ate exchanged:

You don't need to update fhe array if an array item is exchanged with itself.

Look at the picture above for better reference of the problem.