tVertex] = true; q.push(startVertex); while (!q.empty()) { int currentVertex = q.front(); q.pop(); cout << currentVertex << " "; // Explore adjacent vertices for (int neighbor : adjList[currentVertex]) { if (!visited[neighbor]) { visited[neighbor] = true; q.push(neighbor); } } } } }; int main() { Graph graph(5); // Create a graph with 6 vertices graph.addEdge(0, 1); graph.addEdge(0, 2); graph.addEdge(0, 3); graph.addEdge(1, 2); graph.addEdge(2, 4); cout << "Breadth-First Traversal starting from vertex 0:" << endl; graph.BFS(0); return 0; } 2b:T65c,using System; using System.Collections.Generic; using System.Linq; class Graph { private int V; // Number of vertices private List> adjList; public Graph(int vertices) { V = vertices; adjList = new List>(V); for (int i = 0; i < V; i++) { adjList.Add(new List()); } } public void addEdge(int u, int v) { adjList[u].Add(v); adjList[v].Add(u); // For undirected graph } public void BFS(int startVertex) { bool[] visited = new bool[V]; // To keep track of visited vertices Queue q = new Queue(); visited[startVertex] = true; q.Enqueue(startVertex); while (q.Count > 0) { int currentVertex = q.Dequeue(); Console.Write(currentVertex + " "); // Explore adjacent vertices foreach (int neighbor in adjList[currentVertex]) { if (!visited[neighbor]) { visited[neighbor] = true; q.Enqueue(neighbor); } } } } } class Solution { pub