Question 1 Not yet answered Marked out of 5.00 Flag question The code shown below implements the binary search algorithm. But there are two small bugs in the code. What are the bug in the code? How could you fix them? What happens if the target value is included more than once in the array? public int search(Integer array, int e) { int low = array.length 1; int high = 0; while(low e){ } high = mid 1; else { = low mid + 1; } } return -1; } A B I !!! ||| K