|Que.||Consider the following function to traverse a linked list.
void traverse(struct Node *head)
while (head->next != NULL)
printf("%d ", head->data);
head = head->next;
Which of the following is FALSE about above function?
|a.||The function may crash when the linked list is empty|
|b.||The function doesn't print the last node when the linked list is not empty|
|c.||The function is implemented incorrectly because it changes head|
|d.||None of the above|
|Answer:The function is implemented incorrectly because it changes head|