Project Title: Dental Clinic Problem Project Description: A fresh graduate from a dental school opened his own dental clinic and started to make a living. This dental clinic has only one dentist, one dental chair, and n chairs for waiting for patients if there are any to sit on the chair.Initially, all the chairs are empty. If there is no patient, the dentist sleeps in his own chair. When a patient arrives he has to wake up the dentist. If there are many patients and the dentist is attending a patient, then the remaining patients either wait if there are empty chairs in the waiting room or they leave if no chairs are empty. Implement a synchronization method to solve the problem. Using POSIX threads, mutex locks, and semaphores implement a solution that synchronizes the activities of the dentist, and the patients. The total number of patients, the number of chairs are passed as command line arguments. Once a patient thread receives treatment from the dentist, it should terminate. Once all the patient threads are terminated, the dentist thread and the main program should be terminated. Your program should work for any number of patients and chairs. Allocate memory for data structures dynamically based on the input parameter(s)