Write a program that:

1. Calls a method called selectionSort that accepts an integer array as a parameter and sorts the elements in the array using the selection sort algorithm. The selection sort algorithm picks the element with highest value in the array instead of the minimum value and puts it in its correct position. Print the array before it is sorted and after it is sorted.

Calls another method called bubbleSort that accepts an integer array as a parameter and sorts the elements in the array using the bubble sort algorithm. Print the array before it is sorted and after it is sorted.

Calls a third method called InsertionSort that accepts an integer array as a parameter and sorts the elements in the array using the insertion sort algorithm. Print the array before it is sorted and after it is sorted.