A directed grаph is sаid tо be аcyclic if there is nо path such that, fоr all , . Intuitively, there is no way to follow the edges from any vertex such that you arrive where you started. Part 1: Consider the following directed graph: Is it acyclic? If not, provide an example of a cycle in the graph. If so, justify. Part 2: Why would the definition of acyclic given not work for undirected graphs? Answer in a short sentence.