def find_peak_util(arr, low, high, n):
    if n == 0:
        return None

    while low <= high:
        mid = low + (high - low) // 2

        left_ok = (mid == 0 or arr[mid - 1] <= arr[mid])
        right_ok = (mid == n - 1 or arr[mid + 1] <= arr[mid])

        if left_ok and right_ok:
            return mid
        elif mid > 0 and arr[mid - 1] > arr[mid]:
            high = mid - 1
        else:
            low = mid + 1

    return None