***ANSWER IN PYTHON PLEASE***

1. Breadth First Search. Breadth First Search (BFS) is a versatile and efficient strategy for systematically visiting all the nodes in a graph. Given a graph G=(X,E) and a starting point xX, BFS can be described as the following sequence of steps. 1. mark all nodes of G as "unseen". 2. initialize a list seen =[x] and mark x as seen. 3. loop over the elements y in the list seen and, in each step, visit the node y and add all of y 's neighbors that have not been marked as "seen" to the list seen and mark them as seen. Tasks 1. Print out all the nodes of G as discovered when the starting point is node H. 2. Construct a spanning tree of the graph G with node H as starting point. 3. Repeat 1 and 2 for one more starting node