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 cases when several candidate vertices have the same minimal costs, choose a vertex according to its alphabetical order. Based on the same graph shown in A1, use the Kruskal's algorithm to compute the Minimum Spanning Tree (MST). Show intermediate results similar to the textbook example, and show the final MST