Basic Containers ImplementationsSee the posted file LinkedList.pdf LinkedList.cpp and CircList.pdf CircList.cpp which contain source codeto implement a simple list container using 2 different implementations. Also see Containers.pdf which hassome helpful things in it. Use these above resources as a starting point or code base to implement the following:A) New ProgramsWrite SEVEN separate programs using the 2 implementations below:1) Stack Using a circular array implementation2) Queue Using a circular array implementation3) Priority Queue Using a circular array implementation4) Stack Using a linked node implementation5) Queue Using a linked node implementation6) Priority Queue Using a linked node implementationB) DiagramsDRAW some kind of diagram to illustrate the operation of every function.C) AnalysisAnalyze, state, and explain the TIME COMPLEXITY in Big Oh notation for every function.D) Interface FunctionsBoth implementations will share the same set of interface functions belowThe Stack must implement the following functions:push(data);appends data to the head of the listchar pop(void);removes the head node and returns data; returns 1 if emptychar peek(void);returns a copy of data at the head but does not remove the head; returns 1 if emptybool isempty(void);returns true if the stack is empty, returns false otherwise
