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

    Args:
        arr: The list of numbers.
        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 array.
    """
    while low < high:
        mid = low + (high - low) // 2

        if arr[mid] > arr[high]:
            # The minimum element must be in the right half.
            low = mid + 1
        elif arr[mid] < arr[high]:
            # The minimum element could be arr[mid] or in the left half.
            high = mid
        else:  # arr[mid] == arr[high]
            # When duplicates are present, we can't decide.
            # Safely reduce the search space by one from the end.
            high -= 1

    # The loop terminates when low == high, pointing to the minimum element.
    return arr[low]

```