The node of a linked list or stack is declared in the following way:

If the functions push and pop are declared, then the nodes can be used to form a stack structure.

Write a function called partialFlipList that reverses the order of the elements of a linked list in the following way:

The function has two arguments: aH$,$ start. The first is a reference that is the address of the head of a nonempty

linked list, and the second is an integer satisfying $0$ start$$ length of the linked list aH$.$

The function reverses the order of the list elements starting at the index given by start $($using zero$-$based index$-$

ing$).$

The function should return nothing.

Cause no memory leaks.

For example, if the list with address of the first node aHead contains nodes with contents $21,35,72,83,27,53,62,$ after

the function call

partialflipList $($aHead$,2)$;

the list that starts at the address aHead should have nodes with contents

because index $2$ starts at $72$ in the original list, so the $21$ and $35$ are kept in the original order, and the remaining elements

are reversed.