Problem3 (20 pts) In the Dining-Philosophers Problem explained in the class, one possible solution to avoid the deadlock problen is to use an asymmetric solution (An odd philosopher picks up first her left chopsticks and even philosopher picks up her right chopstick and then right). Describe this solution using a pseudo-code algorithm assuming that a variable x represent a philosopher's position (x can range from 0 to 4). (RICE