Re-do Problem 1, but now implement the
following method:
i must use this code :-
public static BagInterface
intersection (BagInterface bagA, BagInterface bagB)
and here how my java program must
work
This method must return a new bag
which is the intersection of the two bags: bagA and bagB. An
element appears in the intersection of two bags the minimum of the
number of times it appears in either. For example, {1,1,2}
∩{1,1,2,2,3}= {1,1,2}. Do not forget to state the...