Can I have some step by step help on how to proceed in Eclipse - Java Program ? Can I see an example of how it should look like ? I will attach the extra files.

CCCS 315: Data Structures and Algorithms Assignment 1 Type of Assignment Individual Work Estimated Time: 120 minute Description In this Assignment, you will study, Analyze (Big-O), and implement a singly Linked List Arrays. You also compare an implementation of a method using recursive programming vs iterative programming. Learning Outcomes Evaluation Points 10 40 15 4 69 Recognize the use of the linked-list and recursive programming Apply Big-O notation to analysis of an algorithm Submitting your work Work is to be submitted through MyCourses. Please validate that your ZIP files contain both .java and .class files prior to submitting. Submissions lacking source code cannot and will not be marked. Code formatting Part 1 Java implementation of a Linked List Part 2 Big-O Analysis Questions Part 3 Comparison of recursive vs iterative solution Total Part 1: Java implementation of a Linked List For this part, you will be provided a set of skeleton classes for you to implement a singly linked list of type int. You will also be provided a minimal set of test cases. You are encouraged to augment the test suite. Points 1 2 Import the eclipse project Assignment1.zip into your workspace. The package includes a complete Node class as well as a test suite My LinkedListTest. A skeleton MyLinked List class is provided with the following methods that need to be implemented: 3 3 Method public MyLinkedList() constructor public void add(int data) public void add(int[] data) public void add(My LinkedList 12)