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

Notes:

1. Shift right means moving all elements of the array one position to the right and by this the last element will go to the position of the first element. Example:

If the array contents: 2, 3, 4, 5, 6, 7, 8. After one shift to the right the array will be: 8, 2, 3, 4, 5, 6, 7 and after two shifts to the right the array contents will be: 7, 8, 2, 3, 4, 5, 6.

2. Swap means exchanging the positions of two elements in an array. Example:

If the array contents: 7, 6, 4, 5, 20, 21 then swapping element at position 1 with element at position 3 will make the array: 7, 5, 4, 6, 20, 21