Java help

l uetures For each of the following questions, indicate which data stracture would be best suited to handle each scenario. Your choices are ArrayList. LinkedList, Stack, Queue, Tree, Set, Map and Priority Queue. You may justify your answer with a single sentence. 1. (3 points) You need a data structure to simulate cars coming to and leaving frons a particular traffic light. 2. (3 points) You need to store different animals based on their taxonomy. For each animal, you claesify it based on what features it has. For example, a cat would first be sorted hy seeing if it had a vertebrae, then sorted hased on the fact it was a mammal, and so on. 3. (3 points) You want to count the frequency in which individual characters uccur in a text file. cast conld potentially he reacted to hby casting another spell in response, and most recent spell can itself be responded to by another spell. ad nauseam. These spells the resolve beginning with the most recent card cast, ending with the initial spell cast. What data structure should be used to store these spells s they resolve in the correct order? 4. (3 points) In the card game Magic: The Gathering, players play cards to cast spells. A 12 p Page 3 of 15