Data structures

PLEASE SOLVE ASAP.

don't copy from other code please

QI) Re-implement Singly List structure without using "tail" that points to the last node in the list (using only head), and without using variable "size" that keeps track of how many elements in the list. What is the complexity of each of the following methods in your implementation: addFirst, addLast, size, removeFirst, removeLast, isEmpty. (2) Our implementation of a Doubly List relies on two sentinel nodes, header and trailer. Re-implement the DoublyLinkedList without using these extra nodes. Use only head that points to the first node and tail that points to the last node (similar to the implementation of singly linked list in the slides). Instructions: Create a project on Eclipse, and create a package for each one of the two questions. After you finish implementing Singly linked list and Doubly linked list, test each operation in each type of the lists (addFirst, addFirst, addLast, size, removeFirst, removeLast, isEmpty), and take screenshots. You need to submit the following 1. The project (using export utility). 2. A PDF file contains: the code, a table shows the complexity of the operations in your implementation of singly linked list (requested in Q1), and screenshots of the output when testing the operations in each type