Using c++

Pascal's Triangle is common used for counting the number of combinations of n things taken r ways. The first row of the triangle only contains 1. Each row after the first begins and ends with 1, and all other elements are given by

pascal[n][r] = pascal[n 1][r] + pascal[n 1][r 1].

Create a two-dimensional array and use it to calculate the first 11 rows of Pascals Triangle. Hint: create an array int pascal[11][12]; . The output should look like this:

1

1 1

1 2 1

1 3 3 1

1 4 6 4 1

1 5 10 10 5 1

1 6 15 20 15 6 1

1 7 21 35 35 21 7 1

1 8 28 56 70 56 28 8 1

1 9 36 84 126 126 84 36 9 1

1 10 45 120 210 252 210 120 45 10 1