DEADLOCK-AVOIDANCE-USING-SEMAPHORES

Implement the deadlock free solution to Dining Philosophers problem to illustrate the problem of deadlock and/or starvation that can occur when many synchronized threads are competing for limited resources