Binary Search - Your task is to create a method that searches through a primitive array (int[]). The method should return an array of size 2: the first element is the value at the midpoint where the search converged, and the second element is the value at the previous midpoint checked before the last comparison. If the target value is not found, the method should still return the last midpoint value and the previous value examined. These values will help you trace how the binary search narrows down the search space and finds (or fails to find) the target efficiently.