Identify and apply the fastest sorting algorithm based on the divide and conquer strategy on the following array. Show all the steps in the first iteration.

a) Merge Sort
b) Quick Sort
c) Heap Sort
d) Binary Insertion Sort