Graph Algorithms · Easy problem

A project has tasks $a,b,c,d$ with prerequisites $a \to b, a \to c, b \to d, c \to d$ (the tail must be done before the head). How many different valid orders are there to complete all four tasks?