Note: use java language

Consider a double linked list where head points to the first node, and tail points to the last node.

a: Complete the following fragment of code to removes the n^th node of the list.

int size = total number of nodes in the list

public void remove(int n)

{

If ( n < 0 || n > = size)

{

System.out.println("Invalid position");

return;

}

else

{

}

size--;

}

b) Complete the following fragments of code to insert a node at the beginning of the list.

public class insertFront(int data)

{

}