For each of the scenario. Your choices are Queue. You may justify your answer with a single sentence. following questions, indicate which data structure would be best suited to handle each rayist, Linkedlist. Stack, Queue, Tree, Set, Map and Priority 1. (a points) You seed a data structure to simulate cars coming to and leaving from a particiar trafic light. 2. (3 points) You need to store different animals based on their taxonomy. For each animal, you clamify it based on what fentures it has. For example, a cat would first he sorted by seeing if it hari 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. 4. (3 points) In the card game Magic: The Gathering, players play cards to cast spells. Any single spell cast conuld potentially he reacted to hy 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 so they resolve in the correct order? Page 3 of 15 12 p