This individual assignment is optional. (I'll average it into your assignments grade if you do it; I won't if you don't.)

Here is an array of numbers:

12 6 3 9 10 4

(a) Show how bubble sort would handle this array. Specifically, show what the array would look like each time the positions of two numbers are changed.

(b) Do the same for insertion sort.

(c) Do the same for selection sort.