I need help fixing a binary search implementation. The function should find the leftmost occurrence of a given integer X in a sorted array A. If X is not present, it should return -1. The current implementation has bugs, and I need to correct it by changing at most 3 lines of code. Here's the current implementation: class Solution { int solution(int[] A, int X) { int N = A.length; if (N == 0) { return -1; } int l = 0; int r = N - 1; while (l < r) { int m = (l + r) / 2; if (A[m] > X) { r = m - 1; } else { l = m; } } if (A[l] == X) { return l; } return -1; } } Requirements: The function should return the index of the leftmost occurrence of X in A. If X is not in A, return -1. Handle cases with duplicate values correctly. Avoid array index out of bounds errors. The array A is sorted in non-decreasing order. You can modify at most 3 lines of code. Example: For A = [1, 2, 5, 9, 9] and X = 5, the function should return 2. For A = {1, 2, 3, 4, 5}; and X = 6, the function should return -1. Please provide a solution that addresses all these requirements by changing at most 3 lines of the given code. Explain your changes and why they fix the issues. I tried a lot and made so much efforts, but couldn't able to solve it. I was able to solve it by changing 4 lines of code but requirements is to solve by changing 3 lines of code only, which I was not able to do. Please help and support.