Create, compile, and run a program that manages a linked list. Specifically, create a linked list for the store's inventory. Put at least 12 items in the list. Ask for an item by SKU number. If the item is not in the inventory, just say so. If it is in the inventory, tell the item's name, cost and quantity on hand. Data fields are: Name SKU number Cost of item Quantity on hand Data fields are: Name, SKU number, Cost of item, Quantity on hand For this lab, you will need to use the files BagInterface.java, Item.java, and LinkedBag.java. You should modify Item.java. Also, you should rename it. You can model your code on OnlineShopper.java. You only need to submit any of those files if you change them. Also, please submit a list of the grocery items as a text file along with your code.

You may have found it somewhat tedious and unpleasant to use the debugger and visualizer to verify the correctness of your addFirst and addLast methods. There is also the problem that such manual verification becomes stale as soon as you change your code. Imagine that you made some minor but uncertain change to addLast]. To verify that you didn't break anything you'd have to go back and do that whole process again. Yuck. What we really want are some automated tests. But unfortunately there's no easy way to verify correctness of addFirst and addLast] if those are the only two methods we've implemented. That is, there's currently no way to iterate over our list and get bad its values and see that they are correct. That's where the toList method comes in. When called, this method returns a List representation of the Deque. For example, if the Deque has had addLast (5) addLast (9) addLast (10), then addFirst (3) called on it, then the result of toList() should be a List with 3 at the…

Given the following program segment. Assume the node is in the usual info-link form with the info of the type int. (list and ptr are reference variable of the LinkedListNode type. What is the output of this program? list = new LinkedListNode (); list.info = 20; ptr = new LinkedListNode (); ptr.info = 28; ptr.link= null; list.link ptr; ptr = list; list = new LinkedListNode (); list.info = 55; list.link = ptr; ptr = new LinkedListNode (); ptr.info = 30; ptr.link= list; list = ptr; ptr = new LinkedListNode (); ptr.info = 42; ptr.link= list.link; list.link= ptr; ptr = list; while (ptr!= null) { } System.out.println (ptr.info); ptr = ptr.link;

In C++,