Data structure 20

Here are eight integers: 3,7, 1,2, 0, 5, 0, 8. Sort them using (a) bubblesort, (b) Shellsort with increment 4, 2, 1. Show the result of each sorting step. (6 marks) Compare the best-case and worst-case running time of insertion sort and merge sort. (4 marks)