```python
def all_Bits_Set_In_The_Given_Range(n,l,r):
    # The function name suggests checking for set bits, while the task description
    # mentions "unset". Assuming the function name is the source of truth.
    #
    # 1. Create a mask with bits set from l to r (1-indexed).
    #    - The number of bits in the range is (r - l + 1).
    #    - A block of these many set bits is (1 << (r - l + 1)) - 1.
    #    - Shift this block to the correct position by (l - 1).
    if l > r:
        return True # Vacuously true for an empty range
        
    mask = ((1 << (r - l + 1)) - 1) << (l - 1)
    
    # 2. Check if all bits in n corresponding to the mask are set.
    #    This is true if (n & mask) is equal to the mask itself.
    return (n & mask) == mask
```