if(current.next == null){
        current.next = prev;
        return current;
    }

    Node next1 = current.next;
    current.next = prev;
    prev = current;
    reverseListRecursion(next1, prev);
    return current;


}