Give the implementation of doubly linked list in Java. A doubly linked list contains data, address of the next (successor) node and address of the previous (parent) node. Your program must have the following methods: - public void add (T data) - public void add (int index, T data) - public void addFirst (T data) - public void addLast (T data) - public T remove () - public T remove (int index) - public T removeFirst () - public T removeLast () - public String toString ()