MEstra 7 pointsy) Delete a given node according a given key by ealting search and rem method. public Node removeAt(int key ) ( 9. Figure 2 shows the structure of a Doubly linked list. (no duplicates) size : number of nodes header next element node Figure 2 Structure of a Doubly Linked List number of now the c This doubly linked list has header and trailer nodes. The variable size stores the n is list. Each node has an integer element, next and prev reference. (You do not know t of this list!) Assume that we defined a Node class already urr You can use statement below to allocate a new node named newest whose element is 100, net and prev is null. Node newest = new Node ("100")