input: Write a function that generates the first n elements of the Sierpinski triangle using the provided algorithm. The function should output the Sierpinski triangle pattern for any positive integer n.
  
  def sierpinski_triangle(n): 
      # 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(1) == None
  assert sierpinski_triangle(2) == None
  assert sierpinski_triangle(3) == None
  assert sierpinski_triangle(4) == None
  assert sierpinski_triangle(5) == None
output: def sierpinski_triangle(n): 
      for i in range(n): 
          for j in range(n-i-1): 
              print(' ', end=" ") 
          for j in range(2**i): 
              print('1', end=" ") 
          print() 
          if i > 0: 
              for j in range(2**(i-1)): 
                  print('0', end=" ") 
              print()