It is a written problem , I need the txt file or pdf or docx. files as solutions for them

1.For the following array x [10] = { 45, 20, 50, 30, 80, 10, 60, 70, 40, 90} show the contents of x after the function call split Pos = split(x, 0, 9) is executed, and give the value of the array index splitPos (the first is the pivot).

2.Modify quicksort() to incorporate this modification: In quicksort, we do not splitting sublists further when they have fewer than LOWER_BOUND elements for some constant LOWER_BOUND. When execution of the quicksort algorithm terminates, simply sort the whole list using insertion sort.

3. Use similar diagram for merge sorting the following list of numbers

8, 2, 9, 4, 5, 3, 1, 6

42 9 7 2 7 2479 1 2 3 45 78 9