help ### Graph Traversal Exercise**Objective:**Demonstrate the paths traversed by Depth-First Search (DFS) and Breadth-First Search (BFS) for a given graph. The starting vertex is Eddie. Intermediate steps must be shown.**Graph Description:**- **Vertices:** - Eddie - Beyonce - Alicia - Chris - Dana - George - Frank - Jane- **Edges:** - Eddie is connected to Beyonce and George. - Beyonce is connected to Alicia and Chris. - Chris is connected to Dana. - George is connected to Frank and Jane.**Instructions:**- **Depth-First Search (DFS):** - Start at Eddie. - Explore as far as possible along each branch before backtracking.- **Breadth-First Search (BFS):** - Start at Eddie. - Explore all neighbors at the present depth prior to moving on to nodes at the next depth level.Illustrate each step of both searches, showing the current node being visited and the stack (for DFS) or queue (for BFS) at each stage.

This traversal is used to traverse the graph in a depth-wise manner. It uses the stack data structure for the traversal. For the above-given Graph, the intermediate results with final traversal are given below : Step 1 : Eddie Step 2 : Eddie , Beyonce Step 3 : Eddie , Beyonce , Alicia Step 4 : Eddie , Beyonce , Alicia , Dana Step 5 : Eddie , Beyonce , Alicia , Dana , Chris Step 6 : Eddie , Beyonce , Alicia , Dana , Chris , George Step 7 : Eddie , Beyonce , Alicia , Dana , Chris , George , Frank Step 8 : Eddie , Beyonce , Alicia , Dana , Chris , George , Frank , JaneThis traversal is used to traverse the graph in a breath-wise manner. It uses the queue data structure for the traversal. For the above-given Graph, the intermediate results with final traversal are given below : Step 1 : Eddie Step 2 : Eddie , Beyonce , George , Jane Step 3 : Eddie , Beyonce , George , Jane , Alicia , Chris Step 4 : Eddie , Beyonce , George , Jane , Alicia , Chris , Frank