Starter Code

import java.util.*; import java.io.*; public class Lab5 { static final int NOT_FOUND = -1; // THE INDEX TO RETURN IF KEY NOT FOUND AT ANY INDEX IN ARRAY static int[] arr1 = { 87, 52, 96, 84, 26, 31, 37, 30, 95, 35, 75, 34, 91, 27, 78, 60, 29, 65, 57, 70 }; static int[] arr2 = { 92, 42, 76, 67, 35, 46, 17, 54, 34, 86, 16, 88, 20, 81, 57, 28, 85, 90, 79, 32 }; public static void main( String args[] ) throws Exception { printArray( "arr1 before being sorted: ", arr1 ); selectionSort( arr1 ); printArray( "arr1 after selectionSort: ", arr1 ); printArray( "arr2 before being sorted: ", arr2 ); bubbleSort(arr2 ); printArray( "arr2 after bubbleSort: ", arr2 ); } // ############################################################################################################ static void printArray( String label, int[] array ) { System.out.print( label ); for ( int i=0 ; i  WRITING SELECTION SORT AND BUBBLE SORT Lab #5 combines methods to methods search and sort arrays. Fill in the methods below main. cs. Command Prompt Z:>java Lab5 arri before being sorted: 87 52 96 84 26 31 37 30 95 35 75 34 91 27 78 60 29 65 57 70 arri after selectionSort: 26 27 29 30 31 34 35 37 52 57 60 65 70 75 78 84 87 91 95 96 arr2 before being sorted: 92 42 76 67 35 46 17 54 34 86 16 88 20 81 57 28 85 90 79 32 arr2 after bubbleSort: 16 17 20 28 32 34 35 42 46 54 57 67 76 79 81 85 86 88 90 92 Z:\>  Starter File: Lab5.java You will fill in these methods: worth 20 ponts each. Write them one at a time. Make sure the method you are writing is correct before starting another one.  10% static int indexOfMin( int[] array ) 45% static void selectionSort( int[] array ) 45% static void bubbleSort( int[] array )  +10% X/Credit: If you can add some optimization logic to your bubbleSort such that makes it faster (at least in most/many cases)