1? URUEor FALSE The Leftist Heap would have voted for Bernie Sanders, if he had made it past the DNC. 2. TRUE or FALS If you want to keep your data sorted, you should use a hash table. 3. TRUE or FALSE Searching for a value in a red-black tree is worst-case O(log n). 4. TRUE or FALSE Searching for a value in a min heap is worst-case O(n) 5. TRUE or FALSE Insertion into a hash table using linear probing is worst-case O(n). 6. TRUE or FALSE A red node in a red-black tree can have both a black child and a red child. 7. TRUE or FALSE Deletion in a red-black tree can be worst-case O(n). 8. TRUE or FALSE The priority queue is best implemented with some variation of the heap data structure. 9. TRUE or FALSE A heap is a type of binary search tree. 10. TRUE or FALSE Insertion and Deletion in a leftist heap are built on top of the Merge operation. 11. TRUE or FALSE As long as you have distinct keys, a hash function will never hit a collision. The load factor is the ratio of the number of all possible keys to the size of the hash table. A heap is partially ordered: for each pair of siblings the larger one is the right child of their 12. TRUE or FALSE 13. TRUE or FALSE parent In an array based heap, the left child of index i is located at 2i and the right child is at 2i+1 With an appropriately chosen hash function,table size, and collision handling scheme, the hash 14. TRUE or FALSE 15. TRUE or FALSE table achieves O(1) for insert/search/delete on average. 16. TRUE or FALSE In a leftist heap, any node with two children has a null path length of 0