Problem C: A directed graph is called strongly connected if there is a directed trail from any given node to any other given node. (a). Prove that a directed graph that has a directd Euler Cycle must be strongly connected. (b). Is the converse true (meaning, if a directed graph is strongly connected, must it have a directed Euler cycle)? If true, give a short proof. If false, show a counterexample