*Java*

Tasks/Assignments(s) 1. Create SinglyLinked List class. Apply all the following operations as discussed in the lecture: addFirst: to add new node to the beginning of the linked list. addLast: to add new node to the end of the linked list. addAtPoistion: to add new node to a specific position in the linked list. Remove First: to remove the first node in the linked list. FindNode: to find a node with specific given value. RemoveNode: to remove a specific node from the list. 2. Add more functionality to SinglyLinkedList class. Each node should hold the following values for courses: Course ID, Course Name, Credit Hours, Instructor. 3. Your application should accept inputs from the user as following: == Dynamic Course List by Singly Linked List ====== === The available operations ==== 1. Add a new course 2. Delete a course 3. Search a specific course 4. Display all courses 5. Exit Enter your choice: Enter the order of the course in the list Enter the course ID: CS310 Enter the course Name: Data Structure Enter the course Hours: Enter the course Instructor: Nehad === Dynamic Course List by Singly Linked List ====== === The available operations ==== 1. Add a new course 2. Delete a course 3. Search a specific course 4. Display all courses 5. Exit Enter your choice: Display List: Course #1 CourseID: CS311 Course #1 CourseName:Data Structure Course #1 CreditHours:2 Course #1 Instructor :Nehad Course #2 CourseID: CS310 Course #2 CourseName:OOP1 Course #2 CreditHours:3 Course #2 Instructor : Mohammed === Dynamic Course List by Singly Linked List = === The available operations 1. Add a new course 2. Delete a course 3. Search a specific course 4. Display all courses 5. Exit Enter your choice: Enter the course ID you want to delete: CS311 First course is Successfully removed Dynamic Course List by Singly Linked List ----- == The available operations ==== 1. Add a new course 2. Delete a course 3. Search a specific course 4. Display all courses 5. Exit Enter your choice: Enter the course ID you want to search: CS310 Found in position# 1 === Dynamic Course List by Singly Linked List ====== ==== The available operations 1. Add a new curse 2. Delete a course 3. Search a specific course 4. Display all courses 5. Exit Enter your choice: End of the program !! 4. Try to apply the following samples in your program: Display All nodes DUO 2 2 2 Display All nodes 2 Display All nodes Find the course with course ID=IM131 Delete Node with CoursID=IM411 Delete Node with CoursID=IM122 Display All nodes Deliverables(s) You are required to implement and deliver a Java program as described in the previous