Reverse a singly linked list recursively by dividing linked list in half in each recurrence

Question

How can I write a function in java that reverse a singly linked list by dividing it into half that means (n/2) nodes for first part and rest is second Part (n is size of the