Consider the following code:

java public void fun$($int data$)\{$

Node node $=$ new Node $0.$

node.data $=$ data;

node.next $=$ null;

node.next $=$ head;

head ode; $\}$:

a$.$ Inserts a node at the end of linked lists

b$.$ Inserts a node at the start of linked lists

c$.$ Deletes a node from the end of linked lists

d$.$ Deletes a node from the start of linked lists

$(1)23C$ whe