sequences when sorting items in listwhat method must be defined for those elementswhy why does quicksort perform better than merge sort under what conditions would it be possible for merge sort to perform better than quicksort summarize what happens when list is partitioned summarize what happens when two lists are merged in the merge sort algorithm what is the purpose of the start parameter to the select function of the selection sort algorithm what are the advantages of linked list over randomly accessible list implementation of list data type what are the advantages of randomly accessible list over linked list implementation of list data type how does stack differ from queue in how we access it what is the complexity of the radix sort algorithm programming problems write program that times the quicksortthe merge sortand the built-in sort algorithms in python to discover which one is better and to see their relative speeds to do this you should implement two sequence classesa qsequence and msequence the qsequence can inherit from the pylist class and should implement its own sort algorithm using the quicksort code presented in this the msequence should be similar class using the merge sort algorithm you can sort anything you like if you choose to sort objects of some class you defineremember that you must implement the __lt__ method for that class be sure to randomize the elements in the sequence prior to sorting them using quicksort generate an xml file in the plot format to plot three sequences plot the time it takes to both randomize and quicksort sequence then plot the time it takes to merge sort sequence finallyplot the time it takes to sort the same sequence using the built-in sort method the complexity of merge sort and quicksort is ( log nso by computational complexity the three algorithms are equivalent what does the experimental data reveal about the two algorithmsput comment at the top of your program giving your answer to effectively test these three sorting algorithms you should sort items up to list size of at least elements you can time the sorts in increments of depending on your computeryou may need to play with the exact numbers to some degree to get good looking graph the merge sort algorithm is not as commonly used as the quicksort algorithm because quicksort is an inplace sort while merge sort requires at least space for one extra copy of the list in factmerge sort can be implemented with exactly one extra copy of the list in this exercise you are to re-implement the merge sort this copy belongs to 'acha