build me a code file

Implement the following sorting algorithms for integer values and determine required time for each algorithm: SelectionSort BubbleSort InsertionSort MergeSort QuickSort HeapSort sample input/output : Enter the number of integer elements: 100 Enter the elements: … SelectionSort results: (elements in order) Required time: … microseconds BubbleSort results: (elements in order) Required time: … microseconds InsertionSort results: (elements in order) Required time: … microseconds MergeSort results: (elements in order) Page 3 of 3 Required time: … microseconds QuickSort results: (elements in order) Required time: … microseconds HeapSort results: (elements in order) Required time: … microseconds