Question: 
Write a python function to check whether all the bits are unset in the given range or not.


Model's Code:
def all_Bits_Set_In_The_Given_Range(number, start, end):
    mask = (1 << (end - start + 1)) - 1
    return (number & (mask << start)) == 0



Sample Correct Code:
def all_Bits_Set_In_The_Given_Range(n,l,r):  
    num = (((1 << r) - 1) ^ ((1 << (l - 1)) - 1)) 
    new_num = n & num
    if (new_num == 0): 
        return True
    return False


Asserts:
assert all_Bits_Set_In_The_Given_Range(4,1,2) == True
assert all_Bits_Set_In_The_Given_Range(17,2,4) == True
assert all_Bits_Set_In_The_Given_Range(39,4,6) == False


Tests:
Test 1 of 3: FAIL: AssertionError()

Test 228 of 974: 167/228 (73.24561403508771%): failed