Convert the following c++ code into pep/9 assembly language. #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 Pep simulator

i need the answer quickly

Translate the following C program into NASM.   #include <stdio.h> int ary[] = {12, 40, -2, 89, 35, -7, 6}; int main() {      int sum = 0;      int highest = 0;      for (int x = 0; x < 7; x++) {          if (highest < ary[x])               highest = ary[x];          sum += ary[x];      }      printf("Sum is %d\n", sum);      printf("Highest value is %d\n", highest); } Use indexing (the [ebx+esi] or [ebx+edi] form). You can have several “dw” values on the same line. Use the “loop” command.

Convert the following C++ programs into Pep/9 assembly #include <iostream> using namespace std; void times(int& prod, int mpr, int mcand) { prod = 0; while (mpr != 0) { if (mpr % 2 == 1) prod = prod + mcand; mpr /= 2; mcand *= 2; } } int main(){ int product, n, m; cout << "Enter two numbers: "; cin >> n >> m; times(product, n, m); cout << "Product: " << product << endl; return 0; } Submit: Pep/9 source code along with screen capture showing it running in the Pep simulator

Convert the following C++ program to pep9/Assembly language BR Main format not machine language #include <iostream>using namespace std; int times(int mpr, int mcand){int prod = 0;while (mpr != 0){if (mpr % 2 == 1)prod = prod + mcand;mpr /= 2;mcand *= 2;} return prod;} int main(){ int n, m; cout << "Enter two numbers: ";cin >> n >> m; cout << "Product: " << times(n, m) << endl; return 0;}

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…

In C programming. How do I find the max and min values of the corressponding columns. #include <stdio.h>#include <math.h>#include <stdlib.h>#define NROWS 5#define NCOLS 5 int main(void){    int i,j, max, min, m, n;    float M[NROWS][NCOLS], Mt[NROWS][NCOLS];    char key_hit;        //Input the sizes    printf("ROW size(1-5) :   ");scanf("%d",&m);    printf("Column size(1-5): ");scanf("%d",&n);        //Size Check     while(m>NROWS || n>NCOLS)    {        printf("Please re-enter the sizes. \n");        printf("Row size(1-5)   :  ");scanf("%d", &m);        printf("Column size(1-5) : ");scanf("%d", &n);    }        //Input the Matrix Data     for(i=0; i<m; i++)        for(j=0; j<n; j++)        {           printf("M[%d][%d] = ", i,j);           scanf("%f", &M[i][j]);        }            //Print the Matrix Data     for(i=0; i<m; i++)    {        for(j=0; j<n; j++)        {            printf("%1.2f\t", M[i][j]);        }…

C programming fill in the following code  #include "graph.h" #include <stdio.h>#include <stdlib.h> /* initialise an empty graph *//* return pointer to initialised graph */Graph *init_graph(void){} /* release memory for graph */void free_graph(Graph *graph){} /* initialise a vertex *//* return pointer to initialised vertex */Vertex *init_vertex(int id){} /* release memory for initialised vertex */void free_vertex(Vertex *vertex){} /* initialise an edge. *//* return pointer to initialised edge. */Edge *init_edge(void){} /* release memory for initialised edge. */void free_edge(Edge *edge){} /* remove all edges from vertex with id from to vertex with id to from graph. */void remove_edge(Graph *graph, int from, int to){} /* remove all edges from vertex with specified id. */void remove_edges(Graph *graph, int id){} /* output all vertices and edges in graph. *//* each vertex in the graphs should be printed on a new line *//* each vertex should be printed in the following format:…