1. Why can’t special-purpose registers restrict a process in its allotted memory area? Explain your answer. 2. The following is the “dining philosophers” problem that was originally proposed by E. W....

1.
Why can’t special-purpose registers restrict a process in its allotted memory area? Explain your answer.

2.
The following is the “dining philosophers” problem that was originally proposed by E. W. Dijkstra and is now a part of computer science folklore. Five philosophers are sitting at a round table. In front of each is a plate of spaghetti. There are five forks on the table, one between each plate. Each philosopher wants to alternate between thinking and eating. To eat, a philosopher requires possession of both the forks that are adjacent to the philosopher’s plate. Identify the possibilities of deadlock and starvation (see problem 40) that are present in the dining philosophers’ problem.