Write a program named SortingAlgorithm.java and implement the following sorting algorithm as we discussed in class: public static void bubbleSort(int[] arr) public static void selectionSort(int[] arr) public static void insertionSort(int[] arr) Download all data files and use each of these sorting algorithms to sort the data. Record the sorting time of each algorithm and tabulate results as follows: bubble selection insertion ----------------------------------------------------------- data1(m) 1 2 2 data2(n) 89956 589456 859 ... ------------------------------------------------------------ (m) for millisecond (n) for nano time To test all data files, you need to download your program and all data files, then test your sorting algorithm in local computer. The first line in the data file represents two numbers N and M, followed by N line and each line contains M integers. Use those numbers to create an array and use each of the sorting method to test the time spend to sort the numbers.