26. Given a linked list (using the code from the book), which of the following sets of statements would implement a function to return the last item in the list?

a.
NodePtr here;
here=head;
while(here->link != NULL)
{
here = here ->link;
}
return here->data;
b.
NodePtr here;
here=head->link;
while(here != NULL)
{
here = here ->link;
}
return here->data;
c.
NodePtr here;
while(here->link != NULL)
{
here = here ->link;
}
return here->data;
d.
NodePtr here;
here=head;
while(here->link != NULL)
{
here = here ->link;
}

a.
NodePtr here;
here=head;
while(here->link != NULL)
{
here = here ->link;
}
return here->data;