1. Questions la-d are about developing an efficient implementation of a Set that combines the advantages of a hash table and a balanced binary search tree. In particular, the search function for vour data structure should have O(Ign) worst case complexity and (1) expected case complexity, and it should not be limited to values in a small range (as a bit vector would (a) Describe how you would store data values in memory. (b) Give pseudocode for how you would insert a new value into your data structure. (c) Give pseudocode for how you would search for a given value (d) Briefly justify why your search function has O(lg n) worst case and O(1) expected case complexity