9. Consider the non-empty singly linked list with header node, containing the nodes in the order: [ header-node, 14, 10, 5 ]. Assume the Nodeptr head points to the header-node of the list. Predict the...

data); O 14 NULL O 10 "/>
Extracted text: 9. Consider the non-empty singly linked list with header node, containing the nodes in the order: [ header-node, 14, 10, 5 ]. Assume the Nodeptr head points to the header-node of the list. Predict the output of the following function, when the above list is passed as a parameter. void Search(Nodeptr head){ Nodeptr p1,p2; p1= p2=head; while(p2){ p1=p1->next; p2= p2->next?p2->next->next- >next:NULL; } printf("%d",p1->data); O 14 NULL O 10