can someone help with the implementation of these generic LinkedList methods public boolean isEmpty() public boolean contains(Object o) public Iterator iterator() public boolean add(E e) public boolean remove(Object o) public boolean addAll(Collection c) public boolean addAll(int index, Collection c) public void clear() public E get(int index) public E set(int index, E element) public void add(int index, E element) public E remove(int index) public int indexOf(Object o) public int lastIndexOf(Object o) public List subList(int fromIndex, int toIndex) I have the implementation using only a head node, but need to add a tail to the code and it would be awesome if you could show me how to do that.