Consider the linked list shown. Assume that the nodes are in the usual info$-$link form. If necessary, declare additional variables. $($Assume that list, p$,$ s$,$ A$,$ and $B$ are pointers of type nodeType.$)$

a$.$ Make A point to the node containing info $23.$

list $=A$link$$link;

b$.$ Create and insert the node with info $10$ after the node pointed to by $A.$

newNode $=$ new nodeType; newNode$$info $=10$; newNode$$link $=A$link; $A$ link $=$ newNode;

C$.$ Make list point to the node containing $16.$

$B=B$ link $$ link;

d$.$ Make $B$ point to the last node in the list.

list $=$ NULL;