(*Ignore AVL tree in question 3. It is typo. We just have to use bubble sort to sort this array)

21 3 60 4 9 5 (If numbers are moved, then they should be marked in a different color in the array.) Question 1: For this given array, use Merge Sort to sort this array. You need to give the status of every step Question 2: For this given array, use Quick Sort to sort this array. You need to give the status of every step. Always use the first value of the current sequence as the pivot. Question 3: AVL Tree For this given array, use Bubble Sort to sort this array. You need to give the status of every step