input: Write a function to generate and print a Pascal triangle up to the specified number of rows. The function should print the triangle row by row, with each row containing the appropriate binomial coefficients.
  def PascalTriangle(n):
      # An auxiliary array to store generated Pascal triangle values 
      arr = [0 for i in range(n)] 
        
      # Iterate through every line and print integer(s) in it 
      for line in range(0, n): 
            
          # Every line has number of integers equal to line number 
          for i in range(0, line + 1): 
                
              # First and last values in every row are 1 
              if (i == 0 or i == line): 
                  arr[i] = 1
                    
              # Other values are sum of values just above and left of above 
              else: 
                  arr[i] = arr[i] + arr[i - 1]  
                
          # Printing array in maintenance of order          
          for i in range(0, line + 1): 
              print(arr[i], end=" ")  
          print()   
    
  assert PascalTriangle(5)==None
  assert PascalTriangle(3)==None
  assert PascalTriangle(0)==None
  assert PascalTriangle(1)==None
  assert PascalTriangle(10)==None
output: def PascalTriangle(n):
      arr = [0 for i in range(n)] 
      for line in range(0, n): 
          for i in range(0, line + 1): 
              if (i == 0 or i == line): 
                  arr[i] = 1
              else: 
                  arr[i] = arr[i] + arr[i - 1]  
          for i in range(0, line + 1): 
              print(arr[i], end=" ")  
          print()