Which of the following would completely remove all the nodes in a linked list and return them to the freestore?

void free(NodePtr head)
{
//what goes here?
}
a.
if(head == NULL)
return;
else
{
free(head->link);
delete head;
}
b.
NodePtr here, prev;
while(head->link != NULL)
{
here=head;
prev= head;
while(here->link != NULL)
{
prev=here;
here=here->link;
}
delete here;
prev->link=NULL;
}
delete head;
c.
NodePtr here, prev;
while(head != NULL)
{
here=head;
while(here->link != NULL)
{
prev=here;
here=here->link;
}
delete here;
prev->link=NULL;
}
delete head;
d.
NodePtr here, prev;
while(head->link != NULL)
{
here=head;
prev= head;
while(here->link != NULL)
{
prev=here;
here=here->link;
}
delete here;
prev->link=NULL;
}
delete head;
e. all of the above
f. A and B
g. B and C

f. A and B