input: Write a python function to print binary representation of numbers from 1 to n recursively.
  assert print_binary(3) == None  # Output should be 0b1, 0b10, 0b11 (no return value)
  assert print_binary(5) == None  # Output should be 0b1, 0b10, 0b11, 0b100, 0b101 (no return value)
  assert print_binary(0) == None  # No output (no return value)
output: def print_binary(n):
      def helper(current):
          if current > n:
              return
          print(bin(current))
          helper(current + 1)
      
      if n > 0:
          helper(1)