Discuss the below:
Q: Imagine a circular linked list of integers that are sorted into ascending order as shown :
![309_Circular linked list.jpg](https://secure.tutorsglobe.com/CMSImages/309_Circular linked list.jpg)
The external pointer list points to the last node, which contains the largest integer.
Write a function that revises the list so that its data are sorted into descending order as shown :
![2337_pointer in list.jpg](https://secure.tutorsglobe.com/CMSImages/2337_pointer in list.jpg)
Do not allocate or deallocate nodes.