Which of the following sorting algorithms is described by this text? "Split the array in two parts. Take each part, and split it into two parts. Repeat this process until each part has only two items. Check the order of the two items and swap if necessary. Then, take the sorted part and combine it with an adjacent part, sorting as you combine. Repeat until all parts have been combined."

A)Insertion sort

B)Merge sort

C)Heap sort

D)Quick sort

E)Selection sort