* (10 points) Given the Positional List elass below (implemented with a doubly linked list), complete its reBore

method. You are given 12 blank lines (numbered below) to enter your code, which is more than is needed. public class LinkedPositionalLiatB> implementa PositionalLat

private static class Node Implementa Position (

// Full implementation detaila omitted: only public function signatures are listed

public Node (E o, Node p, Node n) ( /* code omitted */ ) public E getElement () throws IllegalStateException ( /* code omitted */ ) public NodeB> getPrev() ( /* code omitted ./ public Node gotNext() ( /* code omitted */ ) public void setElement (E e) { /* code omitted */ } public void setPrev (Node p) { /* code omitted */ ) public void setNext (Node n) { /* code omitted */ )

)

private Node header: private NodeE> trailer;

private int size = 0;

// You may use this validate function.

You don't need to implement this function.

private Node validate (PositionE> p) throws IllegalArgumentException { /* code omitted */ )

// Implement this function in Java

public E remove (PositionE> p) throws IllegalArgumentException {

// Start of your Java code

1.

2.

3

5

6.

7

8.

9.

10,

11.

12.

// End of your Java code

)

// All other methods of the LinkedPositionallistD are onitted (you don't need thes).

]

Public elaos Libkedhesitinealhistep iepleannta Fondtinalhasteb o prirate natie ciaes Nodeco ieploansta Featleech 1 (l fall leplesastatien detalla calstedt enly polic tuection nignaturen are liated foblic sodece e, Nodecb P, Nodecp in ( // code coicted of ) public Nadecsi getprav() ( / eede omisted of) pablic Nodece getlext () ( / code ceitted %/ ) public rodd iotrlesent (E o) (/f cede ouitced of ) public vald eatprwv (Nedres p) ( / pe code baited of ) ) pablie vold setNirt (Kiodece i) {(4 code ondted of ) private Nodece beader: private Nodecg trailer: private int dize =02 If Implenent thin function ta Java public E rencve (Positione p) throva 111 egalirguesterceptice of If Start of your Java code 1