data strcture using JAVA   i need the codes for all the following functions   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.

Exercise 3 Write a function called middle that takes a list and returns a new list that contains all but the first and last elements. For example: >>> t = [1, 2, 3, 4] >>> middle(t) [2, 3]

Structural Verification Structural verification is, in this case, validating that a data structure is formed according to its specification. For this lab you are given an essentially arbitrary specification, but you could think of this being used to verify a data structure produced by a program that must have certain properties in order to be used correctly. For example, a list must not be circular, or an image file might require a particular header describing its contents. You must implement this function, which examines a matrix and ensures that it adheres to the following specification: bool verify_matrix(int x, int y, int **matrix); This function accepts an X dimension, a Y dimension, and a matrix of y rows and x columns; although it is declared as int **, this is the same type of matrix as returned by parse_life() in PA1, and you should access it as a two-dimensional array. Note that it is stored in Y-major orientation; that is, matrix ranges from matrix[0][0] to matrix[y 1][x -…

C++.Write a function, named SecondNegative, that takes a const reference to a vector of doubles, it should return an const_iterator to the element in the vector that is the second value that is negative. If no such element exists, have the iterator point to one past the end.