6. Implement Bag, by using a LinkedList, i.e., set up an instance variable of type List, fill it in with a LinkedListat the time of the Bags creation, and use it to store new elements as they come in. Note that the LinkedList can provide a working iterator, so you dont need a private class for the iterator, or the Node class either. Your iterator from LinkedList will have a working remove(), but thats OK.Write a client program, TestBag, that puts apple, pear, and apple in a Bag, and then counts the apples in the bag. What methods are available on the Bag object in this client program? In your answer, show Bag.java, TestBag.java, and the answer to the question. Also think about how you could implement a proper Stack ADT by similar means (no answer needed).

7. A basic Map has methods size, isEmpty, containsKey,get,put,remove,clear,keySet, and values, 9 methods. The basic ST has 7 methods (not counting the constructor) listed on page 363.(a) Study each Map method in this order, and for each:i. give its method header ii. say which ST method is closest in action, its method header, and whether it is the same or if different, how

(b) Finally, explain what methods dont match up. Explain how to work around any missing actions by use of the provided methods.