You are given a DAG called G that is the prerequisite graph for a set of courses required for a degree. Each vertex corresponds to a course, and there is an edge from vertex C1 to vertex C2 if and only if C1 is a prerequisite for C2.Give a high-level description of an...
