How can you effectively detect if a linked list is empty?

Question $13$Answer

a$.$

Traverse the list until you find a NULL pointer and then check if you reached the end.

b$.$

Compare the head pointer to a special "empty" node.

c$.$

Check if the head pointer is NULL.

d$.$

Use a counter variable to keep track of the number of nodes and check if it's $0.$