QUESTION 15 Describe an efficient algorithm to find the smallest values from an unordered list of N values. Give the running time in terms of N and K. You may invoke any algorithm presented in class without repeating a step by step description of the algorithm. For example (though not a good or correct solution): Step 1: Use insertion sort to sort the values O(N2) time Step 2: Discard every other element O(N) time Step 3: Print the first Kvalues O(K) time Total time O(N2 +K) T T T Arial 3 (12pt) T-E- E