| Sorting arrays can be performed using either Selection Sort or Insertion Sort or Bubble Sort. Choose any two of these three sorting algorithms and write a function that receives an array of integers and its size and then returns the minimum number of shifts to the right that need to be performed in order that the first sorting algorithm will have less number of swaps than the second one. Write down which is the first and which is the second sorting algorithm​