input: Write a python function to determine the position of the lowest set bit from the right.
  assert find_Rightmost_Set_Bit_Pos(12) == 3
  assert find_Rightmost_Set_Bit_Pos(18) == 2
  assert find_Rightmost_Set_Bit_Pos(16) == 5
output: def find_Rightmost_Set_Bit_Pos(n):
      if n == 0:
          return 0
      position = 1
      while (n & 1) == 0:
          n = n >> 1
          position += 1
      return position