A spanning tree of a given undirected, connected graph G=(V,E) can be found in O(E) time. False, spanning tree algorithms need at least O(V2) time using array implementation and O(ElgV) time using Binary Heap implementation. False, spanning tree algorithms do not work on undirected graphs. The statement is True. No answer text provided