```python
def find_peak_util(arr, low, high, n):
    """
    A recursive function to find a peak element in an array using binary search.
    A peak element is an element that is not smaller than its neighbors.
    """
    # Calculate the middle index of the current search space.
    mid = low + (high - low) // 2

    # Check if the middle element is a peak.
    # A peak must be greater than or equal to its left neighbor (if it exists).
    is_greater_than_left = (mid == 0) or (arr[mid] >= arr[mid - 1])
    # A peak must be greater than or equal to its right neighbor (if it exists).
    is_greater_than_right = (mid == n - 1) or (arr[mid] >= arr[mid + 1])

    if is_greater_than_left and is_greater_than_right:
        return arr[mid]

    # If the middle element is not a peak, then one of its neighbors must be
    # greater than it. We move towards the greater neighbor, as a peak is
    # guaranteed to be in that direction.

    # If the left neighbor is greater, the peak must be in the left half.
    elif mid > 0 and arr[mid - 1] > arr[mid]:
        return find_peak_util(arr, low, mid - 1, n)

    # Otherwise, the right neighbor must be greater, and the peak must be
    # in the right half.
    else:
        return find_peak_util(arr, mid + 1, high, n)
```