Answer Happy

Apply the BFS algorithm on the following graph. The source is selected based on your name, follow the following to select the source: based on the first letter of your name, • If none of the vertices then the the second letter of your name • if not then the third and so on, • if none of your name's letters exist in the order mentioned above, then the source is A. for each vertex show the distance and predecessor and the queue work What is your first name: Malak What is the source: с A F S B D E G