in computer science, the dining philosophers’ problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was formulated in 1965 as a student exercise. It is still used now although many updates and solutions have been presented through the years.
(a) Give a brief explanation to the above problem. Your answer needs to include the problem’s rules and steps.
(b) Write a Java code segment to solve the dining philosophers’ problem. (JAVA CODE PLEASE)