Consider the following code snippet to find the largest element in a linked list: struct Node int val; struct Node *next; *head; int get_max() struct Node* temp = head->next; int max_num = temp->val; while(______) if(temp->val > max_num) max_num = temp->val; temp = temp->next; return max_num; Which of the following lines should be inserted to complete the above code?

Answer: Option B