Write a java program use oop coding that compares the performance $($which algorithm takes more time?$)$ of the following data structures

A$.$singlylinkedlist$($develop the class yourself$)$

B$.$Circularsinglylinkedlist$($develop the class yourself$)$

The performance should be compared based on the following operations:

$1)$insert$-$insertion of $2000$ random values$($without duplicates$)$

$2)$search$-$searching for $2000$random values.my not exist

$3)$swap to nodes x and y in singly linked list Lgiven referances only to x and y $.$repeat this operation for the case when L is circular singly linked list & a doubly linked list $.$

$4)$print $-$print all data in ascending order.

$$