(Implement a doubly linked list) The MyLinkedList class used in Listing 24.6

is a one-way directional linked list that enables one-way traversal of the list.

Modify the Node class to add the new data field name previous to refer to the

previous node in the list, as follows:

public class Node {

E element;

Node next;

Node previous;

public Node(E e) {

element = e;

}

}

Implement a new class named TwoWayLinkedList that uses a doubly

linked list to store elements. The MyLinkedList class in the text

extends MyAbstractList. Define TwoWayLinkedList to extend the

java.util.AbstractSequentialList class. You need to implement all the

methods defined in MyLinkedList as well as the methods listIterator()

and listIterator(int index). Both return an instance of java.util.

ListIterator. The former sets the cursor to the head of the list and the

latter to the element at the specified index. Test using this code:

public class Exercise2{ public static void main(String[] args) { new Exercise2(); } public Exercise2() { TwoWayLinkedList list = new TwoWayLinkedList<>(); System.out.print("Enter 7 integers: "); Scanner input = new Scanner(System.in); double[] v = new double[5]; for (int i = 0; i < 5; i++) v[i] = input.nextDouble(); list.add(v[1]); list.add(v[2]); list.add(v[3]); list.add(v[4]); list.add(0, v[0]); list.add(2, 10.55); list.remove(3); java.util.ListIterator iterator1 = list.listIterator(); while (iterator1.hasNext()) System.out.print(iterator1.next() + " "); java.util.ListIterator iterator2 = list.listIterator(list.size() - 1); System.out.println(); while (iterator2.hasPrevious()) System.out.print(iterator2.previous() + " "); } public static class TwoWayLinkedList implements MyList { } public static interface MyList { } }