Question 3 1 pts Node test (Node head,int data) if (head == null){ head -new Node(; head.data data; else f Node node = head; while (node.next != null){ node = node.next; node.next = new Node(); node.next.data data; return head; What does the code snippet above do? Pint node in order O Insert a node at the head Insert a node at the end search a node