M Seach C Iweve Ge 0aa1www.si8AayMecmiWatacGogle vouTul DcSC3 midtGtome a https://drive.google.com/file/d/1JNMDCuJa athqtLAbl3nRocnit7gAz/view 1. Given the array [73, 52, 41. 12, 34, 76, 1, 39] (a) Draw the array after one entire pass of bubble sort. (b) Draw the array after three passes of insertion sort. c) Draw the array after three passes of selection sort (d) Write the elements that will be sorted by the fifth recursive step of mergesort. (The first recursive step of mergesort is on the first half of the array.) O Type here to search ENG 016 PM 3/10/2019