Write a C function reverseList() that takes a linked-list header as parameter, reverses the order of the nodes. When function returns, 1st node will be the last, 2nd node will be 2nd from end, ..., the last node will be the 1st,

Write a function that changes the places of the first and last nodes of a linked list. I.e. First node will become last node, and the last node will become first node. Others nodes will not be affected. THE FUNCTION WILL NOT EXCHANGE DATA, IT WILL CHANGE LINKS.

Write a function that changes the places of the n'th node and "n+1st" node of a linked list. THE FUNCTION WILL NOT EXCHANGE DATA, IT WILL CHANGE LINKS.