You are required to complete a Synchronization problem in C$.$

The dining philosophers problem is a well known synchronization problem in CS$,$ it introduces N

processes trying to access shared resources. The rules of the problem state that a philosopher must think,

become hungry, and then try to acquire chopsticks. A diner

must have both chopsticks $($the one on their left and right$)$ to

eat. After eating, the diner puts both chopsticks down

and goes back to thinking.

Your task is to implement the dining philosopher problem

as an $`$endless buffet', no stop condition, with a viable solution.

The program is expected to take one number from command

line arguments to indicate the number of diners and chopsticks.

Include some input handling to ensure N $>=2.$

Using semaphores, you are tasked within controlling access to the chopsticks:

$1.$ Each chopstick can be represented as a semaphore:

$2.$ Philosophers must wait to acquire both semaphores $($chopsticks$)$

$3.$ Philosophers eat, if they can,

$4.$ Philosophers put down right chopstrick, then left chopstick.

Starter code is provided. Fill the blank spaces under comments for $6$ mark