$1.$ Continuing with game programming theme, implement Java code to use either MyHashSet or MyHashMap to store $($only$)$ the integer IDs of the other members of the team the player is currently a member of $($the player can join different teams as the game progresses$).$ Use your judgement to choose the most effective of MyHashSet or MyHashMap, include a concise explanation in comments, choose ID numbers for four simulated game characters $($including your main player$$s ID$),$ and create one team id data structure object $($according to your choice$)$ to hold the current ID$$s of the other members of the player$$s team, insert your own unique data into the data structure to define the other members of their current team, excluding at least one of the other characters.

$2.$ Print out the character$$s ID and the ID numbers of the character$$s current team

from the team data structure $($made in step $1)($and any other data associated with

their ID number as you wish$)$ in an informative message

$3.$ Simulated the player joining a new team by manipulating the data structure $($created in step $1)$ using its standard operations to change the ID$$s of the other characters, and then again print the player$$s and other team members IDs in an informative message.

$4.$ Create an unweighted graph object to represent the same current team status

set in the above step, where the vertex data are user identifiers and an edge

exists between two vertices if the two characters currently share a team.

$5.$ Run either a depth first or breadth first traversal in your graph, starting at the

vertex that contains the player$$s user ID$,$ including printouts.