write c$++$ program and

Implement the following sorting algorithms for integer values and determine the number of operations

that each algorithm took.

SelectionSort

InsertionSort

MergeSort

Sample input$/$output

Enter the number of integer elements: $5$

Enter the elements: $47893529$

SelectionSort results: $49293578$

Required number of operations: $14$

InsertionSort results: $49293578$

Required number of operations: $12$

MergeSort results: $49293578$

Required number of operations: $12$