- Show that f(n)O(g(n)) - If f(n) and g(n) represent the worst case running time of two different algorithms, what does f(n)(g(n)) tell us about how many operations they'll do for large inputs? - Suppose we did a DFS on the given graph starting from node 0 , what type of edge is (3,4) ? Is it a tree edge, back edge, forward edge, or cross edge? - Is it possible to run DFS on an acyclic graph and find cross edges? If so, then give and example graph and start node. If not, argue why