Quick sort is being used with Data$[0]$ as the split value. What is the state of the array when the

first recursive call is made?

What is the state of the array when Data$[0]..$Data$[2]$ is sorted using straight selection sort?

What is the state of the array when Data$[0]..$Data$[2]$ is sorted using simple insertion sort?

i just need explanations for these $3$ and their answers