Please use Java

Create a graph, showing the relative speed of sorting algorithms: 1. Bubblesort 2. Insertion sort 3. Selection sort 4. Merge sort Implement the sorting method above. For convenience, you may assume that arra of integers are being sorted. Create an array with a large number of integers, sort it using each of the algorithms, and record the time it takes. Repeat the process for different sized array. Repeat the process at least 10 times, and take the averag of the 10 tries. Your program should do all of the above. e time all times for all algorithms, for all number of items, and draw a graph showing The x-axis of the graph represents the number of items, and the y-axis Record