Sir Please slove all question ..please sir

Take time

using C++ program

Graph 1. Write a program to create and display a graph. You have to use adjacency list to create the graph. B A>B BS >ACCE CE >BE>DE>E DI >CE>E E >B>CE>DI>E XE1>E Vertex list Adjacency list 2. BFS algorithm A standard DFS implementation puts each vertex of the graph into one of two categories: 1. Visited 2. Not Visited The purpose of the algorithm is to mark each vertex as visited while avoiding cycles. The algorithm works as follows: 1. Start by putting any one of the graph's vertices at the back of a queue. 2. Take the front item of the queue and add it to the visited list. 3. Create a list of that vertex's adjacent nodes. Add the ones which aren't in the visited list to the back of the queue. 4. Keep repeating steps 2 and 3 until the queue is empty