Data Structures Using Java ....

1. Write complete implementations of both fixed and resizable array-based Bag. You have to implement them as ADT and provide implementation for all needed methods. 2. Implement a method replace for the ADT bag that replaces and returns a specified object currently in a bag with a given object. 3. The class ResizableArrayBag has an array that can grow in size as objects are added to the bag. Revise the class so that its array also can shrink in size as objects are removed from the bag. Accomplishing this task will require two new private methods, as follows: The first new method checks whether we should reduce the size of the array: private boolean isTooBig() This method returns true if the number of entries in the bag is less than half the size of the array and the size of the array is greater than 20. The second new method creates a new array that is three quarters the size of the current array and then copies the objects in the bag to the new array: private void reduceArray(). Implement each of these two methods, and then use them in the definitions of the two remove methods. 4. Define the methods union, and intersection, and difference, for both fixed and resizable array-based Bag.