• Study the provided BagInterface and the methods implemented in the ResizableArrayBag
• For the following methods that you are to implement in ResizableArrayBag for Project3 of Lab02: equals, removeMax, removeEvery, replace, union, intersection, difference, getAllLessThan, isSubset
  1. give an algorithm in pseudocode
  2. draw memory diagrams showing how the respective bags will look like as the result of the given method call

public interface BagInterface> { public int getCurrentSize(); public boolean isEmpty(); public boolean add(T newEntry); public T remove(); public boolean removeElement(T anElement); public void clear(); public int getFrequencyOf(T anEntry); public boolean contains(T anEntry); public T[] toArray(); public void display(); public boolean equals(Object otherBag); public T removeMax(); /** * Removes every occurrence of a given entry from this bag. * * @param anEntry the entry to be removed */ public void removeEvery(T anEntry); public T replace(T replacement); public BagInterface union(BagInterface otherBag); public BagInterface intersection(BagInterface otherBag); public BagInterface difference(BagInterface otherBag); public boolean isSubset(BagInterface otherBag); public BagInterface getAllLessThan(T anEntry); } // end BagInterface