Problem 2: Write recursive definition of a method named Combinations that takes two integers n and r as parameters and returns the number of unique combinations of r items from a group of n items. Number of combinations C(n,r) for the given parameters n and r can be computed using the equation: n! C(n,r) r! * (n r)! 4! For example, C(4,3) should return 4. 3! • (1)! Take the input from the user and make sure that the input is valid.

Q: Use dynamic programming to solve Pascal’s triangle. Please write code in C++.

A: In this CPP Program which prints pascal triangle. The program which takes no.of  rows as input and…

Q: write a simple c++ program which uses a function and convert the c++ program to assembly language.

A: Add Two Numbers : #include <iostream>using namespace std; void add(int x,int y){…

Q: Do you believe type checking on pointer variables is higher (stricter) in assembly language than it…

A: The pointer is used to store the address of a variable. No,  type checking on pointer variables is…

Q: I need a very basic c++ program written in C++ and then converted to pep9 machine language in…

A: Actually, program is a executable software that runs on a computer.