To gain experience of using and combing different sorting algorithms: election sort, insertion sort, merge sort, and quick sort. project description it is a written assignment, you just need to submit a text file in txt, or docx or pfd format and don't have to submit your testing codes. 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). ( 10 points) 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. (15 points) use the similar diagram as