Problem
1. Which of the following two algorithms would be better suited to finding the 5 largest items in a large data set?
a. selection sort
b. insertion sort
2. (a) Explain how you would adjust the algorithm to efficiently extract the 5 largest items and,
(b) Give the big-Oh complexity for the number of key comparisons used by the preferred method when there are n data items.