Convert the following C++ programs into Pep/9 assembly #include using namespace std; int minimum (int i1, int i2) { if (i1 < i2) return i1; else return i2; } int main () { int n, m; cin >> n >> m; cout << "Minimum: " << minimum (n, m) << endl; return 0; } Submit: Pep/9 source code along with screen capture showing it running in the P

In C++: Examine the code segment. What will be printed? If there are any errors indicate the nature of each error. int a[7] = {31, 12, 32, 14, 25, 16, 27}; int *ptr; ptr = & a[2]; for ( i=1; i<=5; i=i+2) cout << *(ptr +i); cout << a[0] << *ptr << *ptr - 2 << *(ptr -1)) << endl;

Convert the following C++ programs into Pep/9 assembly 1) #include <iostream> using namespace std; void minimum (int i1, int i2){    if (i1 < i2)        cout << i1 << " is less than " << i2 << endl;   else if (i1 > i2)        cout << i2 << " is less than " << i1 << endl;    else        cout << i1 << " equals " << i2 << endl;}int main (){    int n, m;    cout << "Enter two integers: ";    cin >> n >> m;    minimum (n, m);    return 0;} Submit: Pep/9 source code along with screen capture showing it running in the Pep simulator

C++ 6.34 #include <iostream>#include <cstdlib>#include <ctime>using namespace std; void guessGame(); // function prototypebool isCorrect( int, int ); // function prototype int main(){srand( time( 0 ) ); // seed random number generatorguessGame();} // end main // guessGame generates numbers between 1 and 1000 and checks user's guessvoid guessGame(){int answer; // randomly generated numberint guess; // user's guesschar response; // 'y' or 'n' response to continue game // loop until user types 'n' to quit gamedo {// generate random number between 1 and 1000// 1 is shift, 1000 is scaling factoranswer = 1 + rand() % 1000; // prompt for guesscout << "I have a number between 1 and 1000.\n" << "Can you guess my number?\n" << "Please type your first guess." << endl << "? ";cin >> guess; // loop until correct numberwhile ( !isCorrect( guess, answer ) ) cin >> guess; // prompt for another gamecout << "\nExcellent! You guessed the…

Write the report of this course that is the explanation of the algorithm in this program #include<iostream> // include necessary libraries #include<stack> // include necessary libraries #include<locale> // include necessary libraries #include <climits> // include necessary libraries using namespace std; int preced(char ch) {   // defining precedence function if(ch == '+' || ch == '-') {  // if condition return 1;}else if(ch == '*' || ch == '/') {return 2;}else {return 0;}} string inToPost(string infix ) {  // defining push function  stack<char> stk;stk.push('#');   string postfix = "";   string::iterator it; for(it = infix.begin(); it!=infix.end(); it++) { // for loop if(isalnum(char(*it)))  // if condition postfix += *it;else if(*it == '(') // if condition stk.push('(');else if(*it == ')') { // if condition while(stk.top() != '#' && stk.top() != '(') {postfix += stk.top();  stk.pop(); // pop element }stk.pop();   }else {if(preced(*it) >…

Convert the following to Pep/9 assembly: #include <iostream>using namespace std;int main(){  int number;  cin >> number;  if (number % 2 == 0) {     cout << “Even\n”;  }  else {    cout << “Odd\n”;  }  return 0;}

Convert the following C++ program into Pep/9 Assembly. #include <iostream>using namespace std;void SetEqualGreater (int &num1, int &num2){    if (num1 < num2)        num1 = num2;    else        num2 = num1;}int main() {    int x, y;     // Using Local Variables    cin >> x >> y;    SetEqualGreater(x, y);    cout << "x = y = " << x << endl;    return 0;} Submit: Source file along with screen captures showing the program running in the Pep/8 simulator.