The computer language is Java

Program 3 When implementing a queue a linked list uf nodes, is bes o remove elemes a the front of the linked ist and add them a the back. Implement the childhaad game of Hide and Seek, shown in T.ah 11, using a linked list for the queue. The qucue operations for addLast) and removcFiswil ze the node references head and last This process can be simulated using a queuc. The diagram below shows seven players in the elimination process as simulated by a queuc Qucuc Bob Ruth Ne Action Sam Ari Barb Lucy Remove Bobo and Ruth from the front and add them t the end Sam Ari Barb Lucy Bobo Ruth move Ncd Sam Ari Barb ucy Rob Ruth Move Sam and Ari to the end of the list. Lucy Bobo Ruth Sam Ari move Barb Lucy Bobo Ruth Sam Ari Move Lucy and Bobo to the end of the list. Sam Ari Lucy Bobu move Rutlh ove Sam aud Ari to the nd of the list Sam Ari Lucy Bobo Luey Bobo Sam Ari Move Bobo and Sam to the end of the list Remove Ari Move Bobo and Sam to the end of the list Rcmovc Bobo bo Sam Ari Ari Bobo Sam bo Sam Sam um is the on ly person left in line therefore she is IT