1. Briefly describe a bit-vector, giving details about
- How an element of a set is represented by means of a bit-vector
- How bit-vector based sets operate
Give an example of a set and its representation as a bit-vector. [3]2. What is the best-case and worst-case time complexity of the remove() and intersection() operations for a Set ADT, if implemented with an array? Explain (no explanation, no marks). [4]3. What are the main advantages and disadvantages of an array-based implementation of the Set ADT compared to a bitvector-based implementation? State the advantages and disadvantages as separate sections for each. [3]