7) TRUE/FALSE Like heaps, stacks can be used in a natural and elegant sorting algorithm. TRUE/FALSE Queues, on the other hand, are of little use in sorting algorithms. TRUE/FALSE Priority queues are kind of like an automatic sort-the items simply are in order as they come out. TRUE/FALSE Except, of course, that you must still implement the insertion in some way... and that's not likely to be free 8) TRUE /FALSE Access to the first element of a priority queue stored as a heap is o(. TRUE/FALSE Insertion of an element into a priority queue stored as a linked list is o(N). 9) If N items are inserted into a hash table of size H, what is the expected average chain length? 10) TRUE /FALSE The idea of a map is to be able to look up one value with another. TRUE/FALSE Often the lookup value is called the key and the looked-up value is called simply the value TRUE/FALSE As such, we see that any data structure with essentially performs the actions required of a map