
    Write a function to determine if a student has any completed modules within a specific segment of their learning path, where the learning path is represented as a binary sequence with 1s indicating completed modules and 0s indicating incomplete modules. Given a student's learning path status and a range of modules defined by start and end indices, check if all modules in that range are still incomplete (represented by unset bits).
    

    
def all_Bits_Set_In_The_Given_Range(n, l, r):
    """
    Write a function to determine if a student has any completed modules within a specific segment of their learning path, where the learning path is represented as a binary sequence with 1s indicating completed modules and 0s indicating incomplete modules. Given a student's learning path status and a range of modules defined by start and end indices, check if all modules in that range are still incomplete (represented by unset bits).
    

    """
def all_Bits_Set_In_The_Given_Range(n, l, r):
    """
    Write a function to determine if a student has any completed modules within a specific segment of their learning path, where the learning path is represented as a binary sequence with 1s indicating completed modules and 0s indicating incomplete modules. Given a student's learning path status and a range of modules defined by start and end indices, check if all modules in that range are still incomplete (represented by unset bits).
    

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