Completed Binary search 2 problems

[abhayb94]

No description provided.

[super30admin]

Strengths:

• The student has a clear understanding of binary search and its modifications to find first and last occurrences.
• The code is well-commented, making it easy to follow the logic.
• The early check for out-of-range targets is a good optimization.

Areas for Improvement:

• The student could consider adding more edge case checks, such as handling empty arrays or arrays with a single element, though the current implementation already handles these cases.
• The return value in the findPeakElement method (Problem3) is arbitrary (123456), which is not ideal. It would be better to return -1 or throw an exception if no peak is found, though the problem guarantees a peak exists.