a. Consider a doubly-linked list, where each node references the next node and the previous one. Write a class DoublyLinkedNode that represents this node. b. Using that class, assume that our LinkedBag class is using DoublyLinkedNode, rewrite the method remove (T item) Ims.auk.edu.kw Tube csis210 hw2 - Google Docs https://ms.auka Bag Implementation Using Linked-Lists Saturday, February 8, 2020 7:39 PM public class Li m plements anterfacect> private de fide private int numberontries; public Linkedag() Firstlodell: numberOFEntries - and structor ) for sees whether this bog is capty. return to th fut public boolean isimpty() { return number of Entries public boolean IsFol) return false; public int y reture Integer ) Policia e return tries: public boolean entry) de de MacBook Air