ask 1 (50 pts). Eliminate the deadlock by avoiding circular waiting.(Hint: change the order to access chopsticks for some philosophers.)• Task 2 (50 pts). Eliminate the deadlock by avoiding hold and wait. Inother words, if a philosopher is not able to obtain the right chopstick, he/she will release the left chopstick immediately. (Hint: Use PthreadMutex to solve the problem.)• Task 3 (50 pts extra credit). Eliminate the deadlock by limiting that atmost 3 philosophers are able to compete for the chopsticks at the sametime. (Hint: Use Pthread Conditional Variable to solve the problem.)