Consider the following program: const int n=10; int s; //shared variable between two processes (threads) void P1( ) { int i=0; for (i=0;i

Insert locks into the following two functions for stack operations assuming the two functions are executed in two threads.   int Push(int stack[ ], int *top, int new_element){          stack[top]= new_element;          top++;          return 0; }   int Pop(int stack[ ], int *top, int *top_element){      if (top>0) {          top_element= stack[top];          top--;          return 0;      }      else return -1; \\ empty stack }

What are the pid values?

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 -…