1. A single-lane pedestrian bridge connects the two villages of Village1 and Village2. People in the two villages use this bridge to go to other village. The bridge can become deadlocked if people both from Village1 and Village2 get on the bridge at the same time Once a person get on the bridge, he/she is unable to back up.
a. Using exactly one semaphore, design an algorithm that prevents deadlock. Do not be concerned about starvation and inefficiency.
b. Provide a solution using Monitor that is starvation-free.
c. What would be the value of semaphore before entering into Critical Section and after leaving it?