Which of the following algorithm design technique is used in merge sort?

Merge sort utilizes the Divide and Conquer technique. It works by recursively dividing the array into two halves until each subarray contains a single element, then merging these sorted subarrays back together to produce the final sorted array.