i need answer in steps

5. (The Sleeping-Barber Problem) A barbershop consists of a waiting room with $n$ chairs and the barber room containing the barber chair. If there are no customers to be served, the barber goes to sleep. If a customer enters the barbershop and all chairs are occupied, then the customer leaves the shop. If the barber is busy but chairs are available, then the customer sits in one of the free chairs. If the barber is asleep, the customer wakes up the barber. Write a program to coordinate the barber and the customers. 6. The Oddped dancing family has 4 members, Al, Ar, Lar, and Ral. Al has 2 left feet, and Ar has 2 right feet. Both Lar and Ral have normal feet. The family is so unsuccessful that they only possess 2 pairs of shoes (luckily the family members all take the same shoe size). The problem is that they are always getting into deadlocked arguments, each holding one shoe and fighting to obtain their second shoes. Give semaphores coding for each of the 4 dancers which avoids deadlocks and employs the minimum number of semaphores. 7. A new architecture supports atomically swaps contents of two words such as swap (x,y) exchanges values of two variable x and y. Show that the use of the atomic function to solve the critical section problem by clearly describing the entry- and exit