Dear esteemed expert, I kindly request your assistance in solving the following matter at hand. Your expertise and guidance would be greatly appreciated in resolving this question

Write a java program that compares the performance (which algorithm takes more time?) of the following data structures: a) SinglyLinkedList (develop the class yourself) b) CircularSinglyLinkedList (develop the classyourself) c) DoublyLinkedList (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. Some values my not exist. 3) Swap twonodes x and y in a singly linked list L given references only to x and y. Repeat this operation for the case when L is a circular singly linked list \& a doubly linked list. 4) Print - print All data in ascending order Note: You have to provide screen shots of three different runs of the program taken in three different times with a gap of at least one hour. The output must be look like the following table