Please show the following element blocks and the operations in drawings on paper

Please and thank you, I WILL RATE

Use figure 5 in the attached illustrations as a model to show the operations of the algorithm merge, used by merge sort on (A, 0, 4, 9), where A = {0, 1, 5, 7, 8, 2, 3, 4, 6, 9}.

Fig 5: Operation of merge on (numbers, 0, 4, 9), where numbers = {0, 2, 4, 5, 7, 1, 3, 6, 8, 9} and array indices start with 0. 9 Initial values: leftPos = 0, rightPos = 5, mergePos = 0 numbers: mergeNumbers: 0 2 4 5 7 1/3 6 8 9 241 0124157 1 3 6 8 9 After Iteration 1: leftPos = 1, rightPos = 5, mergePos = 1 numbers: mergeNumbers: 0 7 3 6 8 9 024 5 7 1 3 6 8 9 After Iteration 2: leftPos = 1, rightPos = 6, mergePos = 2 numbers: mergeNumbers: (3 0 1 101 5 7 1 3 6 8 After Iteration 3: leftPos = 2, rightPos = 6, mergePos = 3 numbers: mergeNumbers: 0125 7136 8 9 0 1 2 (5) 7136 89 After Iteration 4: leftPos = 2, rightPos = 7, mergePos = 4 numbers: mergeNumbers: 0 121@5713 68 9 0 1 2 3 0 1 3 6 89 After Iteration 5: leftPos = 3, rightPos = 7, mergePos = 5 numbers: mergeNumbers: 02 4 57 13 1689 0 1 3 4 11 3 6 8 9 2 After Iteration 6: leftPos = 4, rightPos = 7, mergePos = 6 numbers: mergeNumbers: 0 24 5 7 1 3 1689 0 2 34 1 5 B1689 After Iteration 7: leftPos = 4, rightPos = 8, mergePos = 7 numbers: mergeNumbers: 2 4 5 0 1 2 3 4 5 : s (@s | 6 6 8 9 After Iteration 8: leftPos = 5, rightPos = 8, mergePos = 8. The main loop ends here. numbers: mergeNumbers: 0 2 4 5 7 1 3 6 8 9 0 1 2 3 4 5 6 7 8 9 After the rest of merge is executed: leftPos = 5, rightPos = 10, mergePos = 10 numbers: mergeNumbers: 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 0 12 8