For each of the LinkedIntList problems, you$$ll be taking a list as a parameter and then directly modifying the links between the nodes $($the public fields$)$ by using the ListNode class defined in LinkedIntList. You are allowed to have as many ListNode variables as you want $($except when told explicitly$).$

For each of the LinkedIntList problems, do not,

call any methods on the LinkedIntList objects,

construct any new ListNode objects for reverse$3$ or firstToLast,

use other data structures such as arrays, lists, queues, etc.,

or mutate the data of any nodes.

reverse$3$

Implement a method to change the following LinkedIntList $($you may assume it has these exact $3$ elements$)$:

front $->5->4->3->/$

Into this sequence of ListNode objects:

front $->3->4->5->/$

This is intended to be a warm$-$up to the other LinkedIntList problems, so you don$$t need to generalize your solution to work for different lists.