2. These three questions about graphs all have the same subparts. Note that for parts (ii), (iv), and (v), your answer should be in terms of an arbitrary k, not assuming k = 4 a. Suppose a directed graph has k nodes, where each node corresponds to a number (1, 2, ..., k) and there is an edge from node i to node j if and only if i