Handling Circular Singly Linked List:
1 - create and add a node at the end of the list: make_list()
2 - insert a node at the beginning: insert_beg()
3 - insert a node at the end: insert_end()
4 - insert a node a specific position or after it: insert_at() and insert_after()
5 - Deletion from beginning, end and at a specific position: delete_beg(), delete_end() and delete_at()
6 - get the length of the list: len_list()
7 - Print element of the list: display()
8 - free memory after you have done with the list: free_list()