Write and simulate a MIPS assembly-language routine that reverses the order of integer elements of an array. It does so by pushing the elements into the stack, and then popping them back into the array. The array and its length are stored as memory words. Use the array: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15. Note: you can check the contents of the stack (if you go “Single Step”) under the “Data” tab, given that “User Stack” under the menu “Data Segment” is checked. Results: Put your MIPS code here and identify the contents of the stack using Stack View show me the output

Please show  Stack.h, Stack.cpp and main.cpp

using c# 5.0 Create a program that allows the user to fill a vending machine and purchase items from it. The program should use a Stack to implement last-in-first-out (LIFO) behavior. The vending machine always vends the item that was most recently added to it. The user should be able to stock an item in the machine or buy an item from the machine. The program should inform the user if the machine is empty when they attempt a purchase. Sample Program Run After your program runs, the console should look similar to the following example. The exact output will vary depending on what the user inputs. Vending Machine Do you want to (A - Add Item, B - Buy Item, E - End): A Coke Do you want to (A - Add Item, B - Buy Item, E - End): A Coke Do you want to (A - Add Item, B - Buy Item, E - End): A Sprite Do you want to (A - Add Item, B - Buy Item, E - End): B You bought a Sprite Do you want to (A - Add Item, B - Buy Item, E - End): B You bought a Coke Do you want to (A - Add Item, B -…

Write a Java program using Stack class to demonstrate the following activities:   Create three empty stacks named stack1, stack2 and stack3 respectively. Push the numbers [6,4,9] into stack1 and [1,2,3] into stack2. Pop the top number of stack1 and top number of stack2 and multiply them. Then, push the multiplication result into stack3. Pop the top number of stack1 and top number of stack2 and divide them. Push the result of division into stack3. Print Stack1, stack2 and stack3. Print the largest number in stack3

Create a code that stores values on the stack in each iteration of the factorial label. How many values are you storing on the stack in each iteration of your factorial label? By how many bytes do you expect the stack pointer to change? using coding composer studio with a MSP432 microcontroller. In assembly language not C or C++.

In an assembly language program, local variables are kept in a stack.True or false: this assertion

Please help with the following in Java Write a Java program create a stack with elements pushed 1, 2, 3, 4 and 5, removes the middle element. Note that you may use only push(), pop(), peek() and empty() methods of the stack.

OCaml Code: The goal of this project is to understand and build an interpreter for a small, OCaml-like, stackbased bytecode language. Make sure that the code compiles correctly and provide the code with the screenshot of the output. Make sure to have the following methods below:    -Push integers, strings, and names on the stack -Push booleans -Pushing an error literal or unit literal will push :error: or :unit:onto the stack, respectively -Command pop removes the top value from the stack -The command add refers to integer addition. Since this is a binary operator, it consumes the toptwo values in the stack, calculates the sum and pushes the result back to the stack - Command sub refers to integer subtraction -Command mul refers to integer multiplication -Command div refers to integer division -Command rem refers to the remainder of integer division -Command neg is to calculate the negation of an integer -Command swap interchanges the top two elements in the stack, meaning that the…