Given the following C code: void funx (struct Node n) if (n--NULL) return printf ("d ",n->data) funX (n->next) What is the aim of this code for function call funX(head) where head is a pointer that...

data) funX (n->next) What is the aim of this code for function call funX(head) where head is a pointer that points to the head of linked list? a) Print the contents of linked list b) Print the contents of linked list in reverse order c) Print even nodes of linked list d) Print even nodes of linked list in reverse order "/>
Extracted text: Given the following C code: void funx (struct Node n) if (n--NULL) return printf ("d ",n->data) funX (n->next) What is the aim of this code for function call funX(head) where head is a pointer that points to the head of linked list? a) Print the contents of linked list b) Print the contents of linked list in reverse order c) Print even nodes of linked list d) Print even nodes of linked list in reverse order