Answer:
Merge Sort algorithm uses Divide and Conquer technique.
Step-by-step explanation:
The technique used by merge sort algorithm is Divide and Conquer because merge sort in it's every iteration divides the array in two equal halves and then sorts them.
Merge sort keeps on dividing the array in two equal halves until there is only one element left in the array.Then it merges every element in sorted order.