JAVA-data structure - please dont implement anything except for scanner - it doesnt have to be very professional and thank you

i meant import by impement

1. Problem Description: In the children's game, Duck, Duck, Goose, a group of children sit in a circle. One of them is elected "it" and that person walks around the outside of the circle. The person who is "it" pats each child on the head, saying "Duck" each time, until randomly reaching a child that the "it" person identifies as "Goose." At this point there is a mad scramble, as the "Goose" and the "it" person race around the circle. Whoever returns to the Goose's former place first gets to remain in the circle. The loser of this race has to leave the game next round of play. The game continues like this until one child stays in the circle. Write software that simulates the game of Duck, Duck, Goose. 1.1 Requirements: You should have at least two classes: your data structure class and the game simulator class. You have to choose the best Linked-list to represent the players in the game (SLL, CLL, DLL) Your code should not have a time complexity higher than O(n?). You are required to log the time of the simulation. Your code should work with special cases. 1.2 Game implementation details: The elected "it" in the game should be chosen randomly for every round. When "it" goes around the circle, he/she can pat the same player with DUCK up two times (see the sample output). Which means, if you have 4 players in the circle, then "it" can go around the circle up to 2 times, "it" should at least pat one player with DUCK before choosing a player to be GOOSE. Goose should be chosen randomly. You should randomly decide who win the race between "t" and Goose. When a player is selected as "it", he/she should start with the player sitting next to him/her. For example, if player 5 was selected as "it", then "it" should start to pat player 6, then 7, etc. The player who wins the race ("it" or Goose), should sit back in the location of the goose