Answer using pseudocode

3-4. [3] Design a dictionary data structure in which search, insertion, and deletion can all be processed in 0(1) time in the worst case. You may assume the set elements are integers drawn from a finite set 1, 2,.., , and initialization can take O(n) time