Question: 
Write a python function to get the position of rightmost set bit.


Model's Code:
def get_First_Set_Bit_Pos(n):
    if n == 0:
        return 0
    return (n & -n).bit_length()



Sample Correct Code:
import math
def get_First_Set_Bit_Pos(n):
     return math.log2(n&-n)+1


Asserts:
assert get_First_Set_Bit_Pos(12) == 3
assert get_First_Set_Bit_Pos(18) == 2
assert get_First_Set_Bit_Pos(16) == 5


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 957 of 974: 732/957 (76.48902821316614%): success