3. Let us assume that we always perform a successful search. That is, in Algorithm 2.1 the item x can always be found in the list S. Improve Algorithm 2.1 by removing all unnecessary operations.

Algorithm 2.1 Binary Search (Recursive) Problem: Determine whether xis in the sorted array S of size n puts: positive integer n, sorted (nondecreasing order array of keys S indexed from 1 to n, a key x. outputs: location, the location of x in S CO if x is not in S) index location (index low index high index mid if (low high) return 0; else t mid L(low high)/21; if (r SImidl) return mid else if (r S mid]) return location (low mid 1); else return location (mid 1 high)