Given the head of a singly linked list and two 1-indexed positions `left` <= `right`, reverse the nodes from position left to right and return the head.