For this task, I need to show the steps of different sorting algorithms and how they will work. Could someone please sketch these questions ? It's not a coding question but to show how sorting works. Thanks!

[0] [1] [2] [3] [4] [5] [6] [7] [8]

3 6 7 2 8 4 1 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: For this given array, use Bubble Sort to sort this array. You need to give the status of every step