Which of the following is true about the merge sortalgorithm?
Group of answer choices

The merge sort algorithm treats the input as two halves,recursively sorts each half, and then merges the sorted halves toproduce a sorted list.

The merge sort algorithm treats the input as two parts, a sortedpart and unsorted part, and repeatedly selects the next value tomove from the unsorted part to the end of the sorted part.

The merge sort algorithm treats the input as two parts, a sortedpart and unsorted part, and then merges the sorted halves toproduce a sorted list.

The merge sort algorithm repeatedly partitions the input intolow and high parts and then recursively sorts each of thoseparts.

Answer rating: 100% (QA)

Answer option 1 Explanation Merge sort is based on Divide Conque... View the full answer