Assume you have a method $($shown below$)$ inside the$$single linked list$$class$.$What does this method do$?$

private E methodB $($Node nref$)$

$\{$

$$Node temp $=$ nref.next;

$$if $($temp $!=$ null$)\{$

$$nref$.$next $=$ temp.next;

$$size$--$;

$$return temp.data

$\}$

$$else

$$return null;

$\}$

Add a new node after the node referenced by nref and return the data of the node$$

Remove a node after the node referenced by nref and return the data of the deleted node or null if the list is empty.

Add a new node before the node that is referenced by nref and return the data of the new node.$$

Remove the first node in the list and return the data of the deleted node or null if the list is empty.