Design and implement a recursive program to determine and print up to the Nth line of Pascal's Triangle, as shown below. Each interior value is the sum of the two values above it.
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
Hints: You might use an array to hold the values for a given line, although that is not necessary. It is not necessary to format the output exactly as presented above.
One recursive approach is:
$T(r, 0) = T(r, r) = 1$
$T(r, c) = T(r-1, c-1) + T(r-1, c)$
Include at least three test runs of different sizes.
