$1.$ Overview: $($Gaming$)$ When you play a board or card game, or when you use a shared computing resource, you get a turn and then wait until everyone else has had a turn. Although the number of players in a game remains relatively static, the number of users of a shared computing service fluctuates. Let$$s assume that this fluctuation will occur.

$1.$ Design and implement an ADT to track turns within a group of people. You should be able to add or remove people and see whose turn is next. Use an array$-$based list in your implementation.

$2.$ Also design an ADT to represent a person. You can be conservative with the amount of data that this ADT contains. Your first ADT will store instances of the ADT person.

$3.$ Write a program that uses$$and therefore tests$$your ADTs completely. Begin with a given group of people; assign these people an initial order, which can be random or user specified. The first new person joining the group should get a turn after all others have had their turns. Each subsequent new person should get a turn after the person who joined the group most recently has had a turn. Your program should process several additions and removals, and should demonstrate that people are given turns correctly.

Based on "Data Structures and Abstractions with Java", $5$th edition, chapter $11,$ project $19,$ page $330$

$4.$ Your submissions should only contain the Player class $($people$),$ the Participants class that contains the list of current Players, the ADTs you create, and the Client class which will test the Participant class as specified above. You can submit them individually, or as a group in one file. The only class which should be public is the Client.

$5.$ Grading: Deviations from the Java Best Practices in writing code will be penalized. Programs should compile and run; failure to do so gets penalties.

Based on "Data Structures and Abstractions with Java", $5$th edition, chapter $11,$ project $19,$ page $330$