(15 pts) A bit vector is simply an array of bits (Os and 1s). A bit vector of length m takes much less space than an array of m pointers. Describe how to use a bit vector to represent a dynamic set of distinct elements with no satellite data. Provide pseudocode for the three common dictionary operations: search, insert and delete, all of which should run in O(1) time. Explain why. 1. (15 pts) A bit vector is simply an array of bits (Os and 1s). A bit vector of length m takes much less space than an array of m pointers. Describe how to use a bit vector to represent a dynamic set of distinct elements with no satellite data. Provide pseudocode for the three common dictionary operations: search, insert and delete, all of which should run in O(1) time. Explain why. 1