Create a java class for a circular singly linked list, where the last node connects back to the first node. In this circular list:

There is no specific "start" or "end."

Instead, the only access to the list is through a reference called current, which can point to any node in the list.

Your class should be able to insert new nodes, search for a specific node, and delete a node.

These operations will be performed relative to the current node. That is$,$ the insertion, search, or deletion happens on the node that is one step downstream of the current node.

A method called step$()$ should move the current reference to the next node in the list.

Key Features:

Insertion: Insert a new node right after the node pointed to by current.

Searching: Search for a specific node $($by value$)$ starting from current and moving around the circle.

Deletion: Remove the node that comes right after current.

Display: Create a method to display the list. Since it$$s circular, you will need to $$break$$ the circle at some point to display the nodes in a linear fashion.

Step Method: Move the current pointer to the next node.

Things to Remember:

You cannot access the node before the current one directly, since it's a singly linked list.

The current pointer should be able to move freely around the list in a circular manner.

There is no "beginning" or "end" of the list, as the last node links back to the first.

Example:

Suppose your list contains nodes with values: A $->$ B $->$ C $->$ D $->$ A $($since it$$s circular$).$

If current points to B and you call the step$()$ method, current should now point to C$.$

If you insert a node E while current is pointing to C$,$ the list will now be: A $->$ B $->$ C $->$ E $->$ D $->$ A$.$