JAVA lab project.

Part A:  
1. Complete in-place heapSort, which takes an array of data, convert it to max heap using bottomup algorithm. The expected run time should be O(n), where n is the total number of data. BubbleDown method is NOT provided, we went over a similar one in class and it’s on class website. swap method is provided and you have to write your own BubbleDown method.
2. Complete the efficient quickSort. Choose the median of three values as the pivot. Switch to insertSort if sub-problem is small. Check with sizes 3, 8, 20, chooses one that gives the best runtime.

Part B
1. Show how an initially empty min heap looks like after inserting following elements one by one in the given order. Draw the min heap and the array. 5, 2, 7, 8, 6, 1, 7
2. Show how a bottom-up min heap construction looks like from the above given values. Draw the min heap and the array. Consider following graph for all remaining problems.
3. Given following adjacency matrix for an unweighted graph. Is the graph strongly connected or weakly connected?