What is the answer for this questions ?

Sort the following list using bubble sort, Show the various passes. 11 15 2 13 6 List the vertices in the order in which they are visited when running both depth-first search and breadth-first search on the digraph shown below, starting at node A. Also indicate the distances from the starting node (A) to all nodes when you run the BFS. Whenever a new vertex to visit must be selected and there is more than one possibility, choose the vertex containing the letter that comes earliest in the alphabet. B E A F D