Use different example for each method such as insertion, merge and bubble sort. Please look for the sample example for help.

Write algorithms and show each steps with the help of example, of the following 1. Insertion sort 2. Merge Sort 3. Bubble sort Consider following for help Example: Selection sort 70 75 89 61 37 . Smallest is 37 . Swap with index 0 37 75 89 61 70 . Smallest is 61 Swap with index 1 37 61 89 75 70 Smallest is 70 . Swap with index 2 37 61 70 75 89 Smallest is 75 Swap with index 3 Swap with itself 37 61 70 75 89 Don't need to do last element because there's only one left 37 61 70 75 89 Algorithm Let A be a linear array of n numbers A [1], A [2], A [3], ......... A[k], A [k+1), ........ A[n]. Swap be temporary variable for swapping (or interchanging) the position of the numbers. Min is the va to store smallest number and Loc is the location of the smallest element. 1. Input n numbers of an array A 2. Initialize i = 0 and repeat through step5 if (i <-1>