##### Which of the operations among union, intersection, membership, cardinality will be the slowest in Linked List?

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? (GATE CS 2004)

**(A)** union only

**(B)** intersection, membership

**(C)** membership, cardinality

**(D)** union, intersection

What is cardinality in linked list???

and what is membership in linked list??

definition of the

set membershipsymbol. The symbol ∈ indicatesset membershipandmeans“is an element of” so that the statement x∈Ameansthat x is an element of thesetA. In other words, x is one of the objects in the collection of (possibly many) objects in thesetA.once go through all nodes of L1 and then of L2 and then serach for elements of both L1 and L2 inintersectioncommonb/w two linked lists print thosesame process as intersection BUT ,.. print all elements of L1 then those elemnts of L2 which were not in L1unionis simple :count all nodesCARDIANALITY.. as above definition... traverse all nodes of L1 and L2 and look for a matchmembershipfinal answer is D