II. (10 points) If we modify Binary Search so that, when called on a sorted array A[1..nof numbers and a number key, it compares key to A[n/3] (the division is integer division), and proceeds similarly to the standard Binary Search (that is, if key = A[n/3] it returns TRUE, if key is smaller it recurses on A[1..(n/3 - 1)], and if key is larger it recurses on A[(n/3 + 1)..n]). Then the running time of the modified binary search remains (Ign). (A) TRUE (B) FALSE