In this project you will implement two small programs.  One program will show an example of stack use and another program will show the use of a Queue 1. Use the STL to create your data structures 2. You should have the following features: a. Add a record b. Find a record c. Delete a record e. View all records Submit two applications (Stack and Queue) with all related code.  Make sure that you insert documentation within your code to add clarity

Select problem below. Your post must include: The problem statement. A description of your solution highlighting the use of the split(), join(), lists and the different list operations involved in solving the problems. Include line numbers from your program. please make it simple and DONT use Java   Create a program and reads a MAC address and determines whether it is syntactically correct or not. Assume the format of the MAC address is dd-dd-dd-dd-dd-dd where dd represents a 2-character hexadecimal number (each character is a digit or a letter between a and f). Use the `split function to access the values in the input MAC address.

How will this project be solved in Python? Thanks. There are example outputs in the picture.

Use this declaration of the Node class: struct Node { int info; Node * next; } ; Node *p, *r, *q; Question 1 Initial Setup Exercise Use a single assignment Example statement to make the p%3p->next->data; variable p refer to the Node with info '2 Final Configuration Use a single assignment Code: statement to assignment statement must refer to both variablesp and q. Use a single assignment statement to make the Code: variable q refer to the Node with info '1'. Use a single assignment Code: statement to make the -20 variable r refer to the Node with info '2'. Use a single assianment I Code:

PLEASE SEPARATE EACH SOURCE CODE

Create the following operations and include a menu-driven main program that will demonstrate your operations. The program will only stop when the user chooses 5 Exit Program. Create Grapha. Adjacency List (Programmer2)b. Adjacency Matrix (Programmer2) Traversal (User will input the source / start)a. BFS (Lead Programmer)b. DFS (Lead Programmer) Find Path (Given source and destination) (Programmer2) Path Cost (Given source and destination) (Lead Programmer) Exit Program (Programmer1) Main Program (Programmer1)

Please answer the remaining questions. This is supposed to be one question with multiple parts

def delete task (..., ...): I param: task_collection (list) holds all tasks; param: an integer ID indexes each task (stored as a dictionary) (str) - a string that is supposed to represent an integer ID that indexes the task in the list returns: 0 if the collection is empty. -1 - if the provided parameter is not a string or if it is not a string that contains a valid integer >=0 representing the task's position on the list. Otherwise, returns the item (dict) that was removed from the provided collection. 11 11 11

Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts…