Reverse a linked list from position m to n. Do it in-place and in one-pass For example Input: 1->2->3-34-)5->NULL, m = 2 and n = 4 Output: 1-4->3->2->5-NULL YOUR ANSWER Original code Java 7 54 * Complete the reverse function below. 56 57 58 59 60 61 62 63 64 65 For your reference: * SinglyLinkedListNode int data; SinglyLinkedListNode next; 67 68 static SinglyLinkedListNode reverse (SinglyLinkedListNode node, int m, int n)