Barrier synchronization problem: A parallel program contains N processes, which execute in synchronized phases (steps). After completing execution of phase i, each process waits for all the other processes to complete their i'th phase. For this purpose, each process executes a function called Barrier Synch(i), after executing the code for phase i. When the last process reaches the barrier and executes this synchronization function, it unblocks all the other (N-1) waiting processes to resume their execution for phase (i+1). This form of execution of steps and barrier synchronization repeats at each phase.

Write synchronization code using semaphores to implement the barrier synchronization problem described above. You should pay attention to race conditions where a process resumed from i'th phase barrier may quickly finish its execution of the next phase and start executing the barrier synchronization code for the (i+1) 'th phase while some other processes are still executing the barrier synchronization code for phase i 

Phase i Phase Process 1 BarrierSynch(i) BarrierSynch (i+1) Process N