1. Write a static bag method called intersection that creates a new bag from two other bags b1 and b2. The number of copies of an integer x in the new bag will always be the minimum of...

1. Write a static bag method called intersection that creates a new bag from two other bags b1 and b2. The number of copies of an integer x in the new bag will always be the minimum of b1.countOccurrences(x) and b2.countOccurrences(x).

2. What elements will be in the sequence s after these statements?