This assignment tasks students with the creation and handling of the classic dining philosopher's problem. Utilize the Little Book of Semaphores Chapter $4\mathrm{.}4$ to assist you with the understanding and implementation of a good solution that avoids deadlock and starvation. Additionally, the video in Unit $7$Establish your own Dining Philosopher's Problem by taking $2$ arguments from the command line $(30\%)$First argument for # of Philosophers, second argument for # of utensilsYou will need at LEAST $4$ Philosophers and $4$ utensils $($equal number of each$)$Your solution should$$ Avoid deadlock $(20\%)$ Avoid starvation $(20\%)$Allow each philosopher to 'eat' at least $5$ times $($to show that the program is workin correctly $(30\%)$

Can I get this code in c$++$ please $.$