Briefly explain what this code is doing and also give its output when n=3. #include using namespace std; int main() { int n; cin>>n; while (n >= 0){ cout << n*n << endl; --n:

#include <iostream>using namespace std;class st{private:int arr[100];int top;public:st(){top=-1;}void push(int ItEM) {top++;arr[top]=ItEM; }bool ise() {return top<0;} int pop(){int Pop;if (ise()) cout<<"Stack is emptye ";else{Pop=arr[top];top--;return Pop;}}int Top(){int TOP;if (ise()) cout<<" empty ";else {TOP=arr[top];return TOP;}}void screen(){ for (int i = 0; i <top+1 ; ++i) {cout<<arr[i];} }};int main() {st c;c.push(1);c.push(2);c.push(3);c.push(4);c.pop();c.push(5);c.screen();return 0;} alternative to this code??

C++ Given code is  #pragma once#include <iostream>#include "ourvector.h"using namespace std; ourvector<int> intersect(ourvector<int> &v1, ourvector<int> &v2) {    // TO DO: write this function    return {};}

This is the C code I have so far  #include <stdio.h>   #include <stdlib.h>   struct employees   {   char name[20];   int ssn[9];   int yearBorn, salary;   };   struct employees **emps = new employees()[10]; //Added new statement ---- bartleby     // function to read the employee data from the user   void readEmployee(struct employees *emp)   {   printf("Enter name: ");   gets(emp->name);   printf("Enter ssn: ");   for(int i =0; i <9; i++)   scanf("%d", &emp->ssn[i]);   printf("Enter birth year: ");   scanf("%d", &emp->yearBorn);   printf("Enter salary: ");   scanf("%d", &emp->salary);   }       // function to create a pointer of employee type   struct employees *createEmployee()   {   // creating the pointer   struct employees *emp = malloc(sizeof(struct employees));   // function to read the data   readEmployee(emp);   // returning the data   return emp;   }       // function to print the employee data to console   void display(struct employees…

>> IN C PROGRAMMING LANGUAGE ONLY << COPY OF DEFAULT CODE, ADD SOLUTION INTO CODE IN C   #include <stdio.h>#include <stdlib.h>#include <string.h> #include "GVDie.h" int RollSpecificNumber(GVDie die, int num, int goal) {/* Type your code here. */} int main() {GVDie die = InitGVDie(); // Create a GVDie variabledie = SetSeed(15, die); // Set the GVDie variable with seed value 15int num;int goal;int rolls;  scanf("%d", &num);scanf("%d", &goal);rolls = RollSpecificNumber(die, num, goal); // Should return the number of rolls to reach total.printf("It took %d rolls to get a \"%d\" %d times.\n", rolls, num, goal); return 0;}

I need the pseudocode or flowchart for the following code:    #include <stdio.h>#include <stdlib.h>#include <string.h>#define array_Length 5#define BUFSIZE 40//Calculate the average int getmean (int *arr, int length) {int sum = 0;for (int i=0; i<length; i++){sum += arr[i];}//end for loopreturn sum/length;}//Output the Maximum int find_Maximum(int *arr,int length) {int max=0;for(int i=1;i<length;++i)if (arr[i]>arr[max])max=i;return arr[max];}//end for loopint main() {//Intialize and Declare Variables int values[array_Length] = {0};char buffer[BUFSIZE];int index = 0;int x = 0;while(x<5) {//Ask user to input integer printf ("Type a number:");x++;if (fgets(buffer, BUFSIZE, stdin) == NULL)break;//Save new int in the array values[index] = atoi(buffer);//Move the index to the next element, wrap around if needed index = (index + 1) % array_Length;//Display the array, maximum number and the average of its valueprintf("[");for (int i= 0; i < array_Length; i++)…

C++ Program #include <string>using std::string; /*** Problem 1: Simple strings & loops** Given a string and an int n, create a new string * made of the first n characters of the original * string, followed by the first n-1 characters of * the original string, and so on. You may assume * that n is between 0 and the length of the string, * inclusive (i.e. n >= 0 and n <= str.length())* * Some examples:* "Chocolate", 4 -> "ChocChoChC"* "Chocolate", 3 -> "ChoChC"* "Ice Cream", 2 -> "IcI" */string decreasing(const string& str, int n){string result = "not done"; // Add your code herereturn result;} /*** Problem 2: Intermediate Strings & Loops** Given an input string, count the number of words ending * in 'y' or 'z' -so the 'y' in "heavy" and the 'z' in "fez" * count, but not the 'y' in "yellow". Make sure that your * comparison is not case sensitive. We'll say that a y * or z is at the end of a word if there is not an alphabetic * letter immediately following…

#include #include using namespace std; //function prototypesint countLetters(char*); int countDigits(char*); int countWhiteSpace(char*); int main() { int numLetters, numDigits, numWhiteSpace; char inputString[51]; cout <<"Enter a string of no more than 50 characters: " << endl << endl; cin.getline(inputString,51); numLetters = countLetters(inputString); numDigits = countDigits(inputString); numWhiteSpace = countWhiteSpace(inputString); cout << "The number of letters in the entered string is " << numLetters << endl; cout << "The number of digits in the entered string is " << numDigits << endl; cout << "The number of white spaces in the entered string is " << numWhiteSpace << endl; return 0; }   int countLetters(char *strPtr) { int occurs = 0; while(*strPtr != '\0') // loop is executed as long as// the pointer strPtr does not point // to the null character which// marks the end of the string // isalpha determines…

here is a and b part plz solve c part   #include <iostream>#include <string.h>#include <stdlib.h>#include <sstream>#include <cmath>using namespace std; int main(){   /*Variable declarations*/int higestDegree,higestDegree1;int diffDegree,smallDegree;std::stringstream polynomial,addpolynomial;/*prompt for degree*/std::cout<<"Please enter higest degree of polynomial"<<std::endl;std::cin>>higestDegree; std::cout<<"Please Enter highest degree of 2nd polynomial"<<std::endl;std::cin>>higestDegree1;int *cofficient=new int[higestDegree+1];//cofficient array creation for 1st polynomailint *cofficient1=new int[higestDegree1+1];//cofficient array creation for 2st polynomail /*taking cofficient for 1st polynomial*/std::cout<<"Please enter cofficient of each term from higest degree to lowest for 1st polynomial"<<std::endl;for(int i=0;i<=higestDegree;i++){std::cin>>cofficient[i];}/*taking cofficient for 2st…

please use DEQUE #include <iostream>#include <string>#include <deque> using namespace std; const int AIRPORT_COUNT = 12;string airports[AIRPORT_COUNT] = {"DAL","ABQ","DEN","MSY","HOU","SAT","CRP","MID","OKC","OMA","MDW","TUL"}; int main(){// define stack (or queue ) herestring origin;string dest;string citypair;cout << "Loading the CONTAINER ..." << endl;// LOAD THE STACK ( or queue) HERE// Create all the possible Airport combinations that could exist from the list provided.// i.e DALABQ, DALDEN, ...., ABQDAL, ABQDEN ...// DO NOT Load SameSame - DALDAL, ABQABQ, etc .. cout << "Getting data from the CONTAINER ..." << endl;// Retrieve data from the STACK/QUEUE here }   Using the attached shell program (AirportCombos.cpp), create a list of strings to process and place on a STL DEQUE container.       Using the provided 3 char airport codes, create a 6 character string that is the origin & destination city pair. Create all the possible…