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). Quick Sort Heap Sort Merge Sort Insertion Sort