Graph Algorithms · Medium problem

A project has tasks $a,b,c,d,e$ with prerequisites $a \to b, b \to c$ (one chain) and $d \to e$ (a separate chain, with no prerequisite link at all between the two chains). How many different valid orders are there to complete all five tasks?