Consider a digraph G = (V, E) with at least two nodes. Prove that the following statements are equivalent: (i) G has a globally reachable node, and (ii) for every pair S, S of non-empty disjoint subsets of V, there exists a node that is an out-neighbor of S or S. Hint: Use induction on the number of nodes in V. Please use clear and readable handwriting