We are going to dive deep into a few of the stl containers because it is cool. But in real life the whole point of stl is to keep you from having to write them yourselves. So the first data structure homework is about using stl. List, Vector, Stack, Queue, Set, Map, UnorderedMap, PriorityQueue 1. Make a Student class that has Name, GPA, and StudentDebt as properties 2. In main, make a List of ints. Add some numbers to it 3. Make a Vector of Students. Add some Student objects to it Make a Stack of Student Pointers. Push and pop some dynamically created Students to it. Make sure you don't leak memory 5. Make a Set of ints. Add some numbers to it 6. Make a Map of strings to ints. Put some movie titles and the year they cam out in it 7. Do #6 with an unordered map And then the hard ones 1. Make a priority queue that uses a Student's GPA for the sort criteria. Add some Student objects and show that the next one popped is the highest GPA 2. Make a priority queue that uses a Student's Debt for the sort criteria. Add some Student pointers for dynamically created Students and show the next one popped is the one with the least debt