In this task, you will experiment with three sorting algorithms and compare their performances. a. Design a class named SortingAlgorithms with a main method. b. Implement a static method bubbleSort that takes an array and its size and sorts the array using bubble sort algorithm. c. Implement a static method selectionSort that takes an array and its size and sorts the array using selection sort algorithm. d. Implement a static method insertionSort that takes an array and its size and sorts the array using insertion sort algorithm. e. In the main method, generate a random array of 10000 elements. f. Call each of the sorting algorithms to sort the random array. You need to measure the execution time of each and take a note and display them on the console output.