Example
List1:-> 3,2,6,8. List2 :-> 5,6,2,8
Note:--(n1:-no. of elements in List1)
Membership:- is particular memeber is present in the set ot not.
Cardinality:- Size of set
For above operations single traversal of linked lists are enough so Linear time.O(n1+n2)
Union & Intersection:- take a new List3 of Size (List1+ List2) for union and min(List1,List2) for Intersection
For Union:--Copy List1 as it is into List3 now for each element of List2 scan List3 for duplicates so O(n1× n2). Copy only if it is not duplicate.
For Intersection:->>Take each element of L1 and scan in List2 for duplicates if avail then copy into List3. So here also O(n1×n2)
So clearly Union & Intersection is taking more time so it is slowest.
Hence Option D is Ans.