Graph Algorithms · Hard problem

Six tasks $a,b,c,d,e,f$ have these prerequisites: $a$ before $b$, $a$ before $c$, $a$ before $d$, $b$ before $e$, $c$ before $e$, $d$ before $f$, and $e$ before $f$. How many different valid orders are there to complete all six tasks?