Q2 Propose a synchronization solution to the following recipe cooking problem. Three chefs (threads) want to cook a recipe of meet, rice and vegies. Each chef has infinite supply of one of the recipe ingredients and will need the other two ingredients from the supermarket. Assume chef1 has meat, chef2 has rice, and chef3 has vegies. The supermarket (thread) puts two of the ingredients, chosen randomly, on sail every day. Chefs are strictly buying ingredients when on sail, which means only one chef will be able to cook every day. How can we use semaphores to solve this problem? All chef thread should be blocked waiting for supermarket sail, only one chef will be allowed to cook. Q2 Propose a synchronization solution to the following recipe cooking problem. Three chefs (threads) want to cook a recipe of meet, rice and vegies. Each chef has infinite supply of one of the recipe ingredients and will need the other two ingredients from the supermarket. Assume chef1 has meat, chef2 has rice, and chef3 has vegies. The supermarket (thread) puts two of the ingredients, chosen randomly, on sail every day. Chefs are strictly buying ingredients when on sail, which means only one chef will be able to cook every day. How can we use semaphores to solve this problem? All chef thread should be blocked waiting for supermarket sail, only one chef will be allowed to cook