Consider a coke machine that has 14 slots. The producer is the delivery person and the consumer is the student using the machine. We use the following three semaphores: Semaphores: Mutex Full Machine/* Number of filled slots */EmptyMachine/* Number of empty slots */Operations that are applicable on semaphores:- wait(semaphore s) signal(semaphore s). Given functions (pseudo-code) delivery_person() and student(): What will be the initial values of the semaphores? Write the missing solution that guarantees mutual exclusion and no deadlocks. Identify' the value: of (X) and (Y) and (Z)? (Part of the code for student () function has been written)/* Initialize */#define NUM SLOTS 14 X)semaphore Mutex =? Y) semaphore FullMachine =