```python
def find_Min(arr, low, high):
    """
    Finds the minimum element in a sorted and rotated array using binary search.

    Args:
        arr: The list of numbers (sorted and rotated).
        low: The starting index of the sub-array to search.
        high: The ending index of the sub-array to search.

    Returns:
        The minimum element in the specified range of the array.
    """
    while low < high:
        mid = low + (high - low) // 2

        # If the middle element is greater than the element at the high index,
        # it means the pivot (the minimum element) must be in the right half.
        if arr[mid] > arr[high]:
            low = mid + 1
        # If the middle element is less than the element at the high index,
        # the right half (from mid to high) is sorted. The minimum element
        # could be the middle element itself or in the left half.
        elif arr[mid] < arr[high]:
            high = mid
        # If arr[mid] == arr[high], we can't determine which half contains
        # the pivot. In this case, we can safely discard the element at the
        # high index and reduce the search space.
        else:
            high -= 1

    # When the loop terminates, `low` and `high` converge to the index
    # of the minimum element.
    return arr[low]

```