Write the program without considering deadlock. Your program should create five Pthreads that run the same procedure as follows (Note: This is pseudo-code).
Make each philosopher print a message at every event (viz., request, allocation, release). The message should show the philosopher number and the relevant fork number, as shown in the above procedure.
Run the program and see whether it will run into deadlock.