Sorting Algorithms

An array of eight integers is to be sorted in ascending order. The original order of the integers in the array is given in the left-most column of the below table. Give the contents of the array after processing the integers through the below seven algorithms. With the exception of the heap sort, which will begin with the integers stored in the initial heap, all algorithms should begin with the integers stored in their original order. In the case of the Binary Search Tree algorithm, assume the integers are inserted into the tree in array index order: first 12, then 100, then 68, etc.

Quicker sort Original Building the Heap sort one pasS BinaryBubble sorMerge sort (tree) sortone pass OrderInitial Heapo1n 12 100 68 110