Which of the following is the correct pseudocode for a merge sort?

1. Correct Answer
   Incorrect Answer
   a

   For each element in the collection
       While there is a next element
           Compare the next unsorted element with the sorted elements
           Merge the element into the correct position in the sorted elements

2. Correct Answer
   Incorrect Answer
   b

   While there are unsorted numbers
       Find the smallest unsorted number
       Merge the element at the end of the sorted elements

3. Correct Answer
   Incorrect Answer
   c

   If there are at least two elements in the collection, partition the collection into unsorted and sorted
       Find the next element in the unsorted
           Merge the element into the sorted partition

4. Correct Answer
   Incorrect Answer
   d

   For each element in the collection
       Read the value of the item
           If the next value is lower, switch it with the previous item

5. Correct Answer
   Incorrect Answer
   e

   If there is more than one element in the collection
       Break the collection into two halves
       Merge sort the left half
       Merge sort the right half
       Compare the two halves
       Merge the two subcollections into a sorted collection