10. Describe an algorithm (in words, not a code), which for a given connected undirected graph G, directs its edges in such a way that the following two conditions are satisfied 1. the resulting directed graph contains a rooted tree all of whose edges are directed away from 2. Every edge not in the tree above forms a directed cycle with some edges of the tree What is the complexity of your algorithm? Explain.(10 points) the root