[0]3[1]6Question 1:[2]7[3]2[4]8Question 3:[5]4(If numbers are moved, then they should be marked in the array.)[6]1[7]9ܩܣ[8]5For this given array, use Merge Sort to sort this array. You need to give the status of every stepQuestion 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.For this given array, use Bubble Sort to sort this array. You need to give the status of every step

UL [0] 3 E [1] 6 Question 1: [2] 7 Question 2: [3] 2 [4] 8 (If numbers are moved, then they should be marked in the array.) Question 3: [5] 4 [6] 1 [7] 9 For this given array, use Merge Sort to sort this array. You need to give the status of every step [8] 5 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. For this given array, use Bubble Sort to sort this array. You need to give the status of every step

UL [0] 3 E [1] 6 Question 1: [2] 7 Question 2: [3] 2 [4] 8 (If numbers are moved, then they should be marked in the array.) Question 3: [5] 4 [6] 1 [7] 9 For this given array, use Merge Sort to sort this array. You need to give the status of every step [8] 5 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. For this given array, use Bubble Sort to sort this array. You need to give the status of every step