which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted, or almost sorted $($at most two elements are misplaced$)$ a$.$ Quick Sort b$.$ Heap Sort c$.$Merge Sort d$.$ Insertion Sort