Part 1: BubbleSort Selection Sort Insertion Sort Implement the above sorting algorithms, and generate average timings (e.g. using time time) on random Lists of various sizes of fraction objects as well as same-size lists of integers (Hint: should you want to print out list-contents to ensure your sort-algorith sorting, you may want to modify your Fraction class's str_0 method to return the str() of a floating point number rounded to about five decimal places, rather than the numeratorldenominator format) Pass a copy of your random list to each sorting-function e.g.: L = GenRandomList() begTime - time() sortedl = bubbleSort (L[:]) endTime = time() bubSum = bubSum + endTime-begTime begTime = time() aortedl - SelectionSort (L[:]) ec. Why do we pass [:) to each function, rather than simply passing L? Collect timings of ten evenly spaced list-sizes (eg zange (10000, 100001, 20000)). using the same list of values for each sort-algorithm. Compare same-size fraction-sort times to integer-sort times. Represent the results of your timings in one or more Excel charts, to best illustrate any differences in each algorithm-class Explain the results shown in your charts. What big-running-times generate which shapes? Part 1: BubbleSort Selection Sort Insertion Sort Implement the above sorting algorithms, and generate average timings (e.g. using time time) on random Lists of various sizes of fraction objects as well as same-size lists of integers (Hint: should you want to print out list-contents to ensure your sort-algorith sorting, you may want to modify your Fraction class's str_0 method to return the str() of a floating point number rounded to about five decimal places, rather than the numeratorldenominator format) Pass a copy of your random list to each sorting-function e.g.: L = GenRandomList() begTime - time() sortedl = bubbleSort (L[:]) endTime = time() bubSum = bubSum + endTime-begTime begTime = time() aortedl - SelectionSort (L[:]) ec. Why do we pass [:) to each function, rather than simply passing L? Collect timings of ten evenly spaced list-sizes (eg zange (10000, 100001, 20000)). using the same list of values for each sort-algorithm. Compare same-size fraction-sort times to integer-sort times. Represent the results of your timings in one or more Excel charts, to best illustrate any differences in each algorithm-class Explain the results shown in your charts. What big-running-times generate which shapes