A1. Consider the following graph. With the indicated edge weights, start from vertex x, use the Breadth First Search (BFS) algorithm (described in the textbook) to compute the BFS tree Show intermediate results similar to the textbook example, and show the final BFS tree. In cas when several candidate vertices have the same minimal costs, choose a vertex a ccording to i alphabetical order. [15 points] .V 4 4