quick sort (you decide on the pivot value consider the following list of integers[ show how this list is sorted by the following algorithmsbubble sort selection sort insertion sort shell sort (you decide on the incrementsmerge sort quick sort (you decide on the pivot value consider the following list of integers[ show how this list is sorted by the following algorithmsbubble sort selection sort insertion sort shell sort (you decide on the incrementsmerge sort quick sort (you decide on the pivot value consider the list of characters[' ',' ',' ',' ',' ',' 'show how this list is sorted using the following algorithmsbubble sort selection sort insertion sort shell sort (you decide on the incrementsmerge sort quick sort (you decide on the pivot value devise alternative strategies for choosing the pivot value in quick sort for examplepick the middle item re-implement the algorithm and then execute it on random data sets under what criteria does your new strategy perform better or worse than the strategy from this programming exercises set up random experiment to test the difference between sequential search and binary search on list of integers use the binary search functions given in the text programming exercises