Insertion and Selection Sort Algorithms work on the principle of iteration and repetition while Merge Sort Algorithms work on the principle of Divide and Conquer

Using the numbers provided, map out and explain the steps that should be taken to sort the list using:

$($i$)$ Insertion Sort algorithm,

$($ii$)$ Selection Sort algorithm

$($iii$)$ Merge Sort algorithm

$5314867$