Q1 (28 points) Students go to a store to play video games. If there's no free game machine, student will wait until the supervisor assigns a machine for him/her, otherwise s/he will just take one of the free machines. When any machine becomes free, the supervisor will let the first student on line use the machine. After a student finishes, s/he releases the computer and waits until another one is done. When the group (of two) is formed, they leave.

Initially all the game machines are available. The number of machines is numMachines=5. Using semaphores and operations on semaphores, synchronize the 2 types of threads (student and supervisor). Roughly, before synchronization, a possible execution in pseudo-code might be:

Student: arrive at store //napping play //if machine is available form group leave

Supervisor:

while(true)

{

assign game machine

}

__________________________________________________________________________________________