In addition to the instructions on the screenshot, please ensure that your program is made in C++ with comments. Please also ensure that screenshots are taken for the source code and the executed version, including all possible cases. Finally, add your code in a manner so I can just copy and paste it for review. Thanks. Here is a sample outputSample run 1Enter number of rows: 7Sample run 21Sample run 31111116121Enter number of rows: 109151118Enter number of rows: 1311104661517361915531012812202620152184131014141513101512615 2056 7016111033126 126111535 35 21214131101556 288436 84 126 1261115617362128 56 70 56 281884 36845 120210 252 210 120165330 462 462 330 165495 792 924 792 495 2201991101111211 2. Pascal TriangleIn this problem, you will create at least 3 functions with the following prototypes://This function returns the factorial of nint fact(int n)//This function creates a jagged dynamic 2D array and fills//it with the values in pascal trinagle.int** pascal(int rows)//This functions print the pascal trianglevoid printPascal(int **arr, int rows)Please use the following test driver code in the main function.▼int main() {int **arr;int rows;cout <<"Enter number of rows: ";cin >> rows;arr pascal (rows);print Pascal(arr, rows);}//..end main

Answered: n addition to the instructions on the…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

100%

In addition to the instructions on the screenshot, please ensure that your program is made in C++ with comments. Please also ensure that screenshots are taken for the source code and the executed version, including all possible cases. Finally, add your code in a manner so I can just copy and paste it for review. Thanks.

Here is a sample output
Sample run 1
Enter number of rows: 7
Sample run 2
1
Sample run 3
1
1
1
1
1
1
6
12
1
Enter number of rows: 10
9
1
5
11
1
8
Enter number of rows: 13
1
1
10
4
66
15
1
7
36
1
9
1
55
3
10
1
28
1
220
2
6
20
1
5
21
84
1
3
10
1
4
1
4
15
1
3
10
1
5
1
2
6
15 20
56 70
1
6
1
1
10
3
3
126 126
1
1
15
35 35 21
2
1
4
1
3
1
10
1
5
56 28
84
36 84 126 126
1
1
15
6
1
7
36
21
28 56 70 56 28
1
8
84 36
8
45 120
210 252 210 120
165
330 462 462 330 165
495 792 924 792 495 220
1
9
9
1
10
1
1
1
12
1
1

2. Pascal Triangle
In this problem, you will create at least 3 functions with the following prototypes:
//This function returns the factorial of n
int fact(int n)
//This function creates a jagged dynamic 2D array and fills
//it with the values in pascal trinagle.
int** pascal(int rows)
//This functions print the pascal triangle
void printPascal(int **arr, int rows)
Please use the following test driver code in the main function.
▼int main() {
int **arr;
int rows;
cout <<"Enter number of rows: ";
cin >> rows;
arr pascal (rows);
print Pascal(arr, rows);
}//..end main

Expert Solution

Step 1

The c++ program is given below:

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions