Need help with Data Structures. Make sure it's JAVA ORIGINAL and PLEASE MAKE IT JAVADOC FORMAT AS WELL.

Circular Linked-list implementation Objective: Design and implement a circular doubly linked-list Synopsis: A circular doubly linked-list is a doubly linked-list is a doubly liked-list where the next reference of last element leads to the first element of the list and the previous reference of the first element leads to the last element in the list. Circular doubly linked-list is often implemented as a sorted list because adding element in the correct order make more sense in this data structure Requirements: You are to design a circular doubly-linked list class with the standard add, remove, and find(contains) capabilities. Here is a list of items that must be described in details 1. A general description of your class, its required components, and how the class functions 2. Each data member, including access modification, name, data type, and justification of existence (do you absolutely need them??!!) 3. Each method including access modification, name, expected return data, input parameters exactly how the method operates, and justification of existence. Please note, constructors, and getters/setters are methods. All of these items can be submitted as a single header file with doc comments Note: While your required implementation is very minimal, you may want to take a look at the standard Java linked-list at http://docs.oracle.com/javase/7/docs/api/java/util/LinkedList.html for some guidelines Circular Linked-list implementation Objective: Design and implement a circular doubly linked-list Synopsis: A circular doubly linked-list is a doubly linked-list is a doubly liked-list where the next reference of last element leads to the first element of the list and the previous reference of the first element leads to the last element in the list. Circular doubly linked-list is often implemented as a sorted list because adding element in the correct order make more sense in this data structure Requirements: You are to design a circular doubly-linked list class with the standard add, remove, and find(contains) capabilities. Here is a list of items that must be described in details 1. A general description of your class, its required components, and how the class functions 2. Each data member, including access modification, name, data type, and justification of existence (do you absolutely need them??!!) 3. Each method including access modification, name, expected return data, input parameters exactly how the method operates, and justification of existence. Please note, constructors, and getters/setters are methods. All of these items can be submitted as a single header file with doc comments Note: While your required implementation is very minimal, you may want to take a look at the standard Java linked-list at http://docs.oracle.com/javase/7/docs/api/java/util/LinkedList.html for some guidelines