Java

Given the following definition for a doubly-linked list collection class without cycles or dummy nodes: class StringList extends AbstractCollection ( private class Node f public String data; public Node prev, next; public Node (String d, Node p, Node n) data d; prev p; next n; private Node head, tail; private int numItems; private int version; private class Mylterator implements Iterator { private Node nextNode head; private boolean canRemove = false; private int myVersion version; public String next) f II error checking (not shown) String result = nextNode.data; nextNode next Node . next ; canRemove true; return result; public void remove ) f I TODO Write the remove method without using any other methods. Ignore to implement "fail-fast" semantics. invariants. Don't forget