Write a method named binarySearchRotated that performsa binary search for a value in a "rotated" sorted array. Yourmethod accepts two parameters: the array and the value to searchfor, and returns the index where the element is found in the array,or -1 if not found. The array's elements are in sortedorder except "rotated" right by a given amount. For example, if anarray a stores [-8, 0, 3, 6, 10, 19, 22] but isrotated right by 3, its elements would be [10, 19, 22, -8, 0,3, 6]. So the call of binarySearchRotated(a, 22) wouldreturn 2.

The challenge of this problem comes from trying to solve it asefficiently as possible. An optimal solution can run inO(log N) time for an array oflength N.

You may assume that the array is in sorted order.