Consider this variation on the DoublyLinkedList implementation from class. public class DoublyLinkedlist private Node head, tail; private static class Node ( public Node prew, next: public String data; public Node(Node prev, String data,N ode next) this,prev prev; this.nextnext ; this.data data; public DoublyLinkedlisto ( head tail natt e Add data to the end (tail) of the Dou blyLinkedList public void add(String data) t if (tail ult) head tail-new Node(null, data, null): else assert (tail.next null); tail.next =new Node [tail, data, nu tail tail.next: f the list ent to retrieve ifi is invalid) Retrieve an element from the middle o * eparan i Zero-based index of the elen *@return The 1enent TBD: what to do public String get(int i { Node current head; for (int j = 0; j