Given the following algorithm which is used to find used to find the smallest element in a list, by finding the kth largest element.

Write a more efficient algorithm for finding the smallest element in an unsorted list.

Then, compare your algorithm with the algorithm above. Specifically GIVE the exact number of comparisons required by your algorithm, versus the exact number of comparisons for the algorithm above.

process is The algorithm for this Find thLargest( list, N, K) / list the values to look through VIN the size of the list // the element to select for i = 1 to Kdo largest list [1] largest Location = 1 for j = 2 to N-(i-1) do if list til > largest then largest = listijl largest Location = j end if end for Swap{ list [N-(i-1)]. list[largest Location] > end for return largest