help please

Exercises Q1) Write java program to compare time consumed by bubble sort, selection sort, and insertion sort to sort an array of 1000, 100000, 500000. (generate random numbers) public static void bubbleSort(int[] a) { int outer, inner for (outer a length - 1; outer > 0; outer-) (Il counting down. for (inner = 0; inner a[inner + 1]) { Il if out of order... int temp = a[inner]: 11.then swap a[inner] = a[inner + 1]: a inner + 1] = temp: public static void selection Sort(int[] a) { int outer, inner, min; for (outer 0; outer 0 && array[inner - 1] > temp) { array[inner] = array[inner - 1); inner- array[inner] = temp: och in search for non-exit