You are given the following skeleton for binary search. Fill it in with correct Java code in each blank. This method returns the index of keyin the array, or -1 if keyis not in the array. int binarySearch | int [] data, int key, int begin, int end ) { if { return -1; } int mid = i if ) { return mid; } else if ( ) { return } else return }