(d) Suppose a CS curriculum consists of n courses, al of them mandatory. The pre- requisite graph G has a node for each course, and an edge from course to course u graph representation, and computes the minimum number of semesters necessary to complete the curriculum, assuming that a student can take any number of courses in each semester. The running time of your algorithm should be linear. (3 points)