Write a multithreaded program that implements and solves the $$dinning lawyers$$ deadlock example that you studied in Lab$8.$ However, you are required to use binary semaphores instead of mutex locks. Use the following description: $$We have five lawyers, each lawyer needs two chopsticks to eat. The code creates $5$ threads, one per lawyer, and it has five binary semaphores to represent the chopsticks. use sleep$(1)$ in the code to allows all threads $($lawyers$)$ to grab the chopstick on their left before the one on their right. Then $,$ use the sleep$(2)$ in the code to represent the time taken for eating!