please be clear with your answers. for ex. row 1 = # of sem = and Intial val = ...etc

VI. Under each of the following process coordination scenarios, specify the number of semaphores needed and the initial counts of each semaphore. Explain your answers as necessary. (For 514 section ONLY, 10 points) Scenario Number of Initial Value Semaphores of Each Semaphore Provide mutual exclusion to a shared resource be- tween two processes. A producer/consumer problem with two processes accessing a single shared variable. A producer/consumer problem with two producer processes producing values to be stored in a shared buffer of size n with a single consumer process con- suming the values. A pipe-like mechanism between two processes where the pipe is a buffer of 4096 bytes. A readers/writers problem where any number of readers may read, but only one writer may write, at a time to a shared file. If a writer is writing to the file, no reader may read it