Use threads to implement three versions of the Dining Philosophers problem. One of the programs must be free from both deadlock and starvation. One of them should be vulnerable to deadlock, and the last should be vulnerable to starvation.
Finally, you will write a report explaining your implementation and addressing the following questions:
1. What method did you use to ensure that one version of your program was susceptible to starvation but not deadlock?
2. What method did you use to ensure that one version of your program was susceptible to deadlock but not starvation?
3. What method did you use to ensure that one version of your program was not susceptible to starvation OR deadlock?