input: Write a function to generate the first n elements of the Sierpinski triangle. The function should print the triangle directly. If n is 0, the function should do nothing.
  def sierpinski_triangle(n):
      if n == 0:
          return
      # Drawing lines for first row 
      for i in range(2**n): 
          print(' ', end=" ") 
      
      # loop for printing n rows 
      for i in range(1, n+1): 
          # bit pattern for first and 
          # last line of each row 
          for j in range(2**(i-1), 2**i): 
              print('1', end=" ") 
          print() 
          
          # inner rows have opposite bit pattern 
          if i > 1: 
              for j in range(2**(i-1)+1, 2**i-1):  
                  print('0', end=" ") 
              print()
  
  assert sierpinski_triangle(0) is None
  assert sierpinski_triangle(1) is None
  assert sierpinski_triangle(6) is None
output: def sierpinski_triangle(n):
      if n == 0:
          return
      for i in range(n):
          for j in range(n-i-1):
              print(' ', end=' ')
          for j in range(2**i):
              if j & (j >> 1):
                  print(' ', end=' ')
              else:
                  print('1', end=' ')
          print()