Data Structure by Java . help me quickly please ..

18 Given a Single Linked list "list1", whereas 13 is the head and 19 is the tail. 13-->6-->19-->5--> 24--> 29 What is the last value of k after executing the following code? == Public void XXXO if (!isEmpty) Node temp = head; int k=1; while(temp.next !=tail) if( (temp.data +temp.next data) k++ else k+=2; temp = temp.next } 1 temp.next next.data) (2 points) None of the above 19 Is it possible that in order traversal of a tree is equal the pre-order traversal (1 Point) Yes No