Question 1 (1 point) Saved This algorithm works by selecting the smallest unsorted item in the list and then swapping it with the item in the next position to be filled. a) Bubble b) Selection c) Insertion d) Merge Question 2 (1 point) Saved This algorithm works using two sets. The sorted part is initially empty. We remove the entries from the unsorted portion one at a time and insert them in the the
