Which loop starts at the first node of a non-empty linked chain and loops all the way through the chain? in curtead White (curr.next I null) curr - curr next Link curn head.next ile (curr next null) curr - Current We curr.net - Link curt - - white (curr next ) Lurr - headest cucurrit while (1) LKC Given a Node class with constructors Node(T data, Node next) and Node(T data), and the code below, select the resulting list pointed to by head: Node a = new Node("R"); Node b nes Node("s", a); Hade d = new Node("T", b); Mode = new Node("u", d); Hade head head -> U->T->S->R head ->R->S->T-> head->->R>S->T head R->UTU The following code will create a series of Link nodes, with the first one pointed to by head. What order will the Link nodes be in after this code is executed? Link bead - new Link("x", null); head.next- new Link("O", new Link("R", null); head.next next next nex Link("F", null); Link c - head; head-c.next; head, next next next - c c.next = null; head->K->D->R->F head -->->F->R head->D->R- >> head->K->R->F->