Question

4. Pascal Triangle. Write a program pascal.py that builds and prints a two-dimensional list (a list of lists) a such that a[n][k contains the coefficient of the k-th term in the binomial expansion of (ty) These coefficients can be organized in a triangle, famously known as Pascals triangle. Every row in the triangle may be computed from the previous row by adding adjacent pairs of values together. Below is a sample invocation of the program s python pascal py 7 1 2 1 1 3 3 1 1:4 6 41 1 5:10 10 51 16 15 20 15 6 1 17 21 35 35 21 7 1 You program should contain the following finctions generate_pascal (n) wlich retunis a list of lists of the coelficients, ad print triangle(coeffs) which prints the corefficients one set per line

write this python program

Answer 1

def generate_pascal(n):
line = [1]
a = []
for i in range(n):
a.append([])
a[i].append(1)
for j in range(1,i):
a[i].append(a[i-1][j-1]+a[i-1][j])
if(n>1):
a[i].append(1)
a[0]=[1]
return a

def print_triangle(coeffs):
for line in coeffs:
for num in line:
print(num,end=' ')
print()

OUTPUT: