Attached is the LinkedList class from this chapter and the ListIterator class. It has the reverse method, which I demonstrated on the Example video. Your assignment is to do the following: - in addition to the first data member, add a last data member, which will always point to the last node in the list (or null if the list is empty).
- add a "size" method to the LinkedList class that returns the number of nodes in the list
- add an "addLast" method to the LinkedList class
- add a "removeLast" method to the LinkedList class
- add a "getLast" method to the LinkedList class
- add a "contains" method to the LinkedList class that returns true or false whether its parameter value is on the list
NOTE: NoSuchElementException should be thrown where appropriate