Q:Question:following is true about the merge sort algorithm? Group of answer choices The merge sort algorithm treats the input as two halves, recursively sorts each half, and then merges the sorted halves to produce a sorted list. The merge sort algorithm treats the input as two parts, a sorted part and unsorted part, and repeatedly selects the next value to move from the unsorted part to the end of the sorted part. The merge sort algorithm treats the inputA:Answer:Answer - option (1) Explanation: Merge sort is bas...