I need the answer as soon as possible

Q-2. Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted (maximum 1 or two elements are misplaced). A Quick Sort B Heap Sort C Merge Sort D Insertion Sort