This is not a programming assignment. Write code or pseudocode. 1. Binary search is usually written in the following way: // Precondition: arr[0..n-l] is in sorted order boolean binarySearch(intl ] arr, int x) f return binarySearch(intl 1 arr, 0, arr.length-l, x); boolean binarysearch(int arr, int left, int right, int x) l /I search for x in arr[left..right] if (left > right) f return false; else t int mid = (left + right) / 2; if (arr[mid] - arr[n-1], return n-1, where int binarysearch(intl ] arr, x) f/* To do