$3\mathrm{.}16.$ Suspose a CS curnailum consists of $17$ courses, all of them mandatory, The coure ar il and anly if is is prerequisite ior we$-$Find an algorition that works directly with ithis graph remresmiation, and computes the ininimum number of semeten necessan io complete the curriculum fassume $($has a saudent can take ay number of roirses in one semester$).$ The running time of your algorilim. shoald be lineat.