Implement a function to search for a node with a given value in a circular linked list.

Write a function to count the number of nodes in a circular linked list.

Analyze the time complexity of each operation $($insertion $($both at the beginning and end$),$ deletion, and traversal$)$ on a circular linked list.

Write a recursive function to print all numbers from $1$ to $n$ in increasing order, and provide the running time.