Completed Binary-Search-2 problems

[param07]

No description provided.

[super30admin]

Your solution for Problem 1 is well-done and correctly implements the required functionality with optimal time and space complexity. Here are some suggestions for improvement:

1. Consider renaming the helper functions to more clearly indicate their purposes, such as binarySearchFirst and binarySearchLast.
2. Add more detailed comments for the initial checks to explain why they are necessary (e.g., early termination if the target is outside the array bounds).
3. Ensure consistency in the use of parentheses in the while loops (e.g., while(low <= high) vs. while low <= high).

These minor improvements will enhance the readability and maintainability of your code.