C++

DAS

1. Write a function to swap the first and last nodes of a linked list. You can use the example given above to develop your solution. In your answer, provide only the required function. 2. Implement the Stack as a linked list. The Stack data structure is managed by LIFO scheme (Last In First Out). As a linked list, it will mean insert and delete only from the rear of the list. 3. Implement the Queue as a linked list. The Queue data structure is managed by FIFO scheme (First In First Out). As a linked list, it will mean insert only from the rear and delete only from the front of the list. 4. Count number of nodes in the list. Part 2: Lab Tasks ( 10 points) Note: Copy this section into a new word file then save it. You will only submit this section of the lab manual. 1. Modify the above program to insert a new node in the middle of list (take a node data from user, search the node and insert new node after this node). 2. Modify the above program to include an operation for searching a value from the linked list. 3. Write a function to delete a matching node (by search) from a linked list of integers. You can use the example given above to develop your solution. In your answer, provide only the required function