please show all the steps and result

Write a program in C$++$ to demostrate the dining philosophers deadlock problem.

First, we could only allow $4$ philosophers to be seated at the table leaving an extra fork.

Second, before the philosophers pick up their left fork, they could check that the right fork is indeed available.

Third, philosophers $1,3,$ and $5$ could pick up their left fork first while philosophers $2$ and $4$ pick up their right fork first.