Draw the stack memory diagram for a function value parameter (see code below): someheader.h int echo_number(int num); somecpp.cpp int echo_number(int num) {   return num; } main.cpp int main() {   auto num = 5;    auto echo = echo_number(num);   return 0; }

Please write comments in the code specifying what it does. Specifications: Demonstrate your understanding of the C++ Priority Queue Abstract Data Type ( ADT ) by writing a program that will demonstrate the basic operations of a priority queue: Enqueue Dequeue Peek IsEmpty GetLength Demonstrate these operations with any program you would like to write.  In fact, if -after reading through the information on priority queues you feel they would be a useful tool for your semester project, feel free to prototype your idea using this lab. You will notice in the demo, I used a priority queue to demonstrate a leaderboard from an example game.  The demo I provided is much more complex than what is expected for this lab, but it demonstrates the use of a priority queue in a larger program.

int machineCompare1(struct machine* mac1, struct machine* mac2){    struct mac1;    struct mac2;    char make1[21], make2[21];    char model1[51], model2[21];     if((lap1 -> make1 == lap2 -> make2) && (lap1 -> model1 == lap2 -> model2))        return 0;    else        return 1;} have to create function to compare make and model of 2 machines - it's using structures - not sure if this is correct/ on the right track?

#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??