input: Write a function to generate the first n elements of the Sierpinski triangle in Python. The function should print the elements in a triangle pattern where each element is either '1' or '0'. If n is 0, the function should print nothing.
  def sierpinski_triangle(n):
      if n == 0:
          return
      for i in range(1, n + 1):
          for j in range(2**(i-1), 2**i):
              if (j // (2**(i-1))) % 2 == 0:
                  print('1', end=" ")
              else:
                  print('0', end=" ")
          print()
  
  assert sierpinski_triangle(0)==None
  assert sierpinski_triangle(1)==None
  assert sierpinski_triangle(2)==None
  assert sierpinski_triangle(3)==None
  assert sierpinski_triangle(4)==None
output: def sierpinski_triangle(n):
      if n == 0:
          return
      for i in range(1, n + 1):
          for j in range(2**(i-1), 2**i):
              if (j // (2**(i-1))) % 2 == 0:
                  print('1', end=" ")
              else:
                  print('0', end=" ")
          print()