Program in c language

A circular linked list is a linked list where all nodes are connected to form a circle. There is no NULL at the end. Any node can be a starting point, which means you can traverse the whole list by starting from any point. You need to stop when the first visited node is visited again. You are given the following unsorted integers: 8, 25, 12, 55, 36, 78, 60, 45, and 100 (a) Insert these integers one at a time in a singly-linked circular list so that circular linked list s an ordered list. (b) Display the ordered circular linked-list after every insertion. (c) Then delete 78, 12, and 45 one at a time and display (print) the new ordered list Use C language and pointer to write this program. Add adequate documentation in the program. Turn in program codes and screen shots of all insertions and deletions