What is the output of the following code snippet for 1->2->3->4->5? void solve(struct Node *head) { while(head != NULL) { printf("%d ", head -> data); head head -> next; } =