In java

TASK: Fill in the following method to implement the Binary Search algorithm HINT: You can assume that the input array is sorted in ascending order i.e., index 0 is the smallest, index 1 is the next smallest, etc.) Sample Input: 1 2 3 4 5 4 Sample Output: true Write a program, test using stdin stdout Time limit: 10 seconds Memory limit: 256 MB own 1 /** 2 * Search a given array for a given element using Binary Search * @param sortedArray A sorted array of int * @param x An int to search for * @return true if x exists in sortedArray, otherwise false 6 */ 7 public static boolean binarySearch(int[] sortedArray, int x) { 8 // YOUR CODE HERE 9}