data structures using java...plz ans fast

4 Assume that reference of head of the singly linked list 1->2->3->4->5 is passed to the below function and the data will be re arranged as 2->3->4->5 ->1. [Consider there is no tail to access the last node] [5] [C Page 1 of 2 Fill in the blanks with the corresponding code for obtaining the above data in the linked list. void func( node t) { node s= while { ) S.next= _=null