Explain the principal differences between the Insertion Sort and Heap Sort algorithms. Be certain you i$.$ provide a general idea of how the algorithms operate, ii$.$ explain which algorithm is generally the most efficient in the worst$-$case scenario, and iii. explain which of the two algorithms is likely preferable if a collection is already sorted or almost entirely sorted. Your response should be $1-2$ paragraphs in length.