Problem 1 [50 points] Let G (V, E) be a directed graph with nodes v1, v2, ..Vn. We say that G is an ordered graph if it has the following properties (i) Each edge goes from a node with a lower index to a node with a higher index. That is, every directed edge has the form vi, v, with i