Q. 6 Suppose each set is represented as a linked list with elements in arbitrary order.
Which of the operations among union, intersection, membership, cardinality will
be the slowest?
(A) union only
(B) intersection, membership
(C) membership, cardinality
(D) union, intersection
Answer: (D)
Explanation:
