(1) To remove a specified entry of a bag that is implemented with a linked chain, first get a reference to the node to remove, then the most efficient approach is to:

a) move the data in the first node to the referenced node , then remove the first node

b) search through the chain again and find the previous node, have its next reference jump over the node to remove

c) shift the nodes down in reverse order

d) move the data in the last node to the referenced node , then remove the last node

(2)

Which bag behavior(s) would need to be modified when implementing a set?

(for this problem, answer can be more than 1.)

a) add()

b) clear()

c) contains()

d) toArray()