The MyLinkedList class used in Listing 24.5 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. Define TwoWayLinkedList to implements MyList. 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 (see Figure 20.4). The former sets the cursor to the head of the list and the latter to the element at the specified index. Test your new class using this code from https://liveexample.pearsoncmg.com/test/ Exercise24_03.txt.

Data from Listing 24.5

1 publ1c class MyLinkedList 1mplements MyList private Node head, tail: private int size = 0: // Number of el ements in the list 2 4 ** Create an empty list/ public My LinkedList () { 6 7 8 * Create a list from an array of objects / 10 public MyLinkedList(E[] objects) { for (int i = 0; i < objects.1length; i++) add (objects[i]): 11 12 13 14 1** Return the head element in the list / publ1c E getFirst() { 1f (size == 0) { return null1; 15 16 17 18 19 20 else {