Provide relevant parts of C-like codes for N processes (N is an arbitrary integer larger tha in N process N way synchronization, i.e. each process has a synehronization point in its eode, and any f processes has to wait for other N-1 processes to cross or reach their synchronization points, and only then that process nay cross its synchronization point. One solution, that follows ideas from the similar problems we discussed in the class, would be to use N semaphores all initialized to O. But for this problem, your solution may use only 2 semaphores. Hint: All processes but one would have the same code for this synchronization