In the Dining$-$Philosopher implementation, explain how allowing at most four philosophers to be hungry simultaneously solves the

deadlock problem.

$1)$Assume philosophers first acquire the chopstick on the left and then the one on the right. A philosopher who is sitting to the left of the non$-$

hungry philosopher will always get his second chopstick. If he also gets his first chopstick, he will eat. Else, his left neighbour will eat.

$2)$Assume philosophers first acquire the chopstick on the left and then the one on the right. A philosopher who is sitting to the right of the non$-$

hungry philosopher will always get his second chopstick. If he also gets his first chopstick, he will eat. Else, his right neighbour will eat.

$3)$Assume philosophers first acquire the chopstick on the left and then the one on the right. A philosopher who is sitting to the left of the non$-$

hungry philosopher will always get his first chopstick. If he also gets his second chopstick, he will eat. Else, his left neighbour will eat.

$4)$Assume philosophers first acquire the chopstick on the left and then the one on the right. A philosopher who is sitting to the right of the non$-$

hungry philosopher will always get his first chopstick. If he also gets his second chopstick, he will eat. Else, his right neighbour will eat.