Answer:
A spanning tree is a subset of Graph G, which has all the vertices covered with minimum possible number of edges. Hence, a spanning tree does not have cycles and it cannot be disconnected.. By this definition, we can draw a conclusion that every connected and undirected Graph G has at least one spanning tree.
To answer your question the answer would be B compatible browsers
the answer is True
there has to be a balance between security and the user experience
