Provide relevant parts of C-like codes for processes X, Y, Z, W, V and S in the following synchronization problem. Each process has a special (synchronization) point in its code, and each process may cross its synchronization point only if at least three other processes reached or crossed their synchronization points. Assume that each process will cross its synchronization point only once.

Please use semaphores and just wait(x) and signal(x) system calls, where x is a semaphore.