Algorithm question

Each problem is 2 pts 1. For the following graph give BFS results of steps of the algorithm by giving sequence of states of the queue (list of vertices) before next iteration of the while loop. Each vertex should be given in the form (vertex number, distance, parent). So for example queue element (s, 3, t) should mean that vertex s was discovered at a distance 3 from the root and it was discovered from vertext. Assume that the graph is given by its adjacency list representation in which edges of every vertex are ordered by the numbers of end vertices. a. start with vertex 3 b. start with vertex 4 6 2 8 10 3 EDES applied to the following graph in the form of each vertex is given by its