Use threads to implement three versions of the DiningPhilosophers problem. One of the programs must be free from bothdeadlock and starvation. One of them should be vulnerable todeadlock, and the last should be vulnerable to starvation.
What method did you use to ensure that one version of yourprogram was susceptible to starvation but not deadlock?
What method did you use to ensure that one version of yourprogram was susceptible to deadlock but not starvation?
What method did you use to ensure that one version of yourprogram was not susceptible to starvation or deadlock?
Need help with this in C or java
Solution