What is the efficiency of the below algorithms? A. Using merge sort to sort an array of size n, then use binary search to find n2 elements a. O(n2) b. O(logn) c. O(n(logn)) d. O(n2(logn)) e. O(n3) B. Using merge sort to sort an array of size n, then use binary search to find (1/2)n elements. a. O(n2) b. O(logn) c. O(n(logn)) d. O(n2(logn)) e. O(n3) Problem 3.8 Wrong binary search (10 pts) The code below is someone's implementation of binary search, but it is faulty. escribe how you would change the code to correct it. 1 public class BinarySearchf 2 public int faultyBinarySearch(int[] arr, int x){ int 2=,r=arr. Length-1; int m=(2+r)/2; while (2x)l=m+1;if(arr[m]