The question is from: Operating Systems (8th Ed.), Chapter 6, Problem 18P.

Please answer the question in steps.

Problem Suppose that there are two types of philosophers. One type always picks up his left fork first (a "lefty"), and the other type always picks up his right fork first (a "righty"). The behavior of a lefty is defined in Figure 6.12. The behavior of a righty is as follows: begin repeat think; wait (fork i+1) mod 5); wait (forklil); eat signal (forkli); signal (fork(i+1) mod 5]) forever end Prove the following: a. Any seating arrangement of lefties and righties with at least one of each avoids deadlock. b. Any seating arrangement of lefties and righties with at least one of each prevents starvation programs diningphilosophers semaphore fork [5] (1) int i void philosopher (int i) while (true) think wait (fork [i]) wait (fork (i+1) mod 5]); eat signal (fork [(i+1) mod 51) signal (fork[i]) void main par begin (philosopher (0), philosopher (1), philosopher (2), philosopher (3) philosopher (4)) Figure 6.12 A First Solution to the Dining Philosophers