HW-Sorting Part #1: Sorting practice Sort the following sequnce of numbers 1, 4, 1,5,9,2,6,5, 3,5 Sort it using mergesort, quicksort and bucket sort For the quicksort, choosing the first value for the pivot is.not a good choice so use median-of-three approach to choose the pivot. No need to write code for this Identify all the steps for each in a Word document, with the last step showing the fully sorted list