
    Write a function to determine if all seats in a specified section of a bus (from seat l to seat r) are empty, given a binary occupancy map n where each bit represents a seat's status. The function should verify the vacancy status of consecutive seats within the specified range and return true only if all seats in that section are unoccupied.
    

    
def all_Bits_Set_In_The_Given_Range(n, l, r):
    """
    Write a function to determine if all seats in a specified section of a bus (from seat l to seat r) are empty, given a binary occupancy map n where each bit represents a seat's status. The function should verify the vacancy status of consecutive seats within the specified range and return true only if all seats in that section are unoccupied.
    

    """
def all_Bits_Set_In_The_Given_Range(n, l, r):
    """
    Write a function to determine if all seats in a specified section of a bus (from seat l to seat r) are empty, given a binary occupancy map n where each bit represents a seat's status. The function should verify the vacancy status of consecutive seats within the specified range and return true only if all seats in that section are unoccupied.
    

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