Linked Lists: A linked list is a collection of nodes which contain data elements as well as the information about where the next element in the list is stored. Each element is stored using a node format, which contains two fields: item (data) and link (next). Data field contains the information and Link filed contains a reference to the address of next element in the list. Requested work: 1. Define a function newList to create a new empty linked list. 2. Define a function sizelist to return the size of a given linked list 3. Define a function displayList to display the content of all nodes of a given linked list. 4. Define a function addNodeHead to add a new node on the head of a given linked list. 5. Define a function addNodeQueue to add a node on the queue of a given linked list. 6. Define a function delNodeHead to delete a node from the head of a given linked list. 7. Define a function delNodeQueue to add a node from the queue of a given linked list. 8. Define a function insertNodePos to add a new node on the given position of a given linked list. 9. Define a function delNodePos delete a node from a given position of a given linked list. 10. Test all previously defined functions in the main method