Merge sort uses which of the following technique to implement sorting?

Answer: c
Explanation: Merge sort uses the divide and conquer technique to sort an array. The process involves three main steps:
Divide: The array is split into two halves recursively until each subarray has one element.
Conquer: Each subarray is sorted individually (base case: single element is already sorted).
Combine: The sorted subarrays are merged back together in sorted order.
This divide-and-conquer approach ensures efficient sorting with O(n log n) time complexity.