Consider the following pseudo-code about the dining philosophers problem. Note that the take_fork(i) is a function used to acquire the fork and put_fork(i) is a function used to release or put the forks back. #define N5 void philosopher(int i) { while(TRUE) { think(); take_fork(i); take_fork((i+1) % N); eat(); put_fork(i); put_fork((i+1) % N) } } Briefly explain whether the above code avoids deadlock and starvation.