
    Write a function to determine if all parking spaces within a specified zone (from position l to r) in a parking lot are vacant, given the lot's occupancy status as a binary number where each bit represents a space (0 for vacant, 1 for occupied). The function should efficiently check the vacancy status of all spaces within the specified zone boundaries and return true only if the entire zone is vacant.
    

    
def all_Bits_Set_In_The_Given_Range(n, l, r):
    """
    Write a function to determine if all parking spaces within a specified zone (from position l to r) in a parking lot are vacant, given the lot's occupancy status as a binary number where each bit represents a space (0 for vacant, 1 for occupied). The function should efficiently check the vacancy status of all spaces within the specified zone boundaries and return true only if the entire zone is vacant.
    

    """
def all_Bits_Set_In_The_Given_Range(n, l, r):
    """
    Write a function to determine if all parking spaces within a specified zone (from position l to r) in a parking lot are vacant, given the lot's occupancy status as a binary number where each bit represents a space (0 for vacant, 1 for occupied). The function should efficiently check the vacancy status of all spaces within the specified zone boundaries and return true only if the entire zone is vacant.
    

    """
    num = (1 << r) - 1 ^ (1 << l - 1) - 1
    new_num = n & num
    if new_num == 0:
        return True
    return False