please provide orignal solution. 3. Big-O Dating Game. Match each data structure with the correct desired behavior so that each algorithm achieves its best Big-O (runtime efficiency). Feel free to...

please provide orignal solution.


3. Big-O Dating Game. Match each data structure with the correct desired behavior so that each algorithm achieves its best Big-O (runtime efficiency). Feel free to justify each match.

Structure A: I'm the kind of algorithm who wants a data structure that isn't slow minded. When I ask it a question, I expect my data structure to be able to find the answer quickly and efficiently, but I don’t need to keep my data in any particular order. (What data structure would be appropriate in a find-heavy algorithm?)

Structure B (2): I like to keep things tidy. I like it best when everything is in its rightful place and would like to meet a data structure that isn't going to make that difficult. (What data structure would be appropriate for an algorithm that needs to maintain the ordering of my data?)