Graph Algorithms · Easy problem

A scheduling DAG has tasks $m,n,o,p,q$ with prerequisites $m \to o, n \to o, n \to p, o \to p, o \to q, p \to q$. How many of these $5$ tasks have NO prerequisite at all (so they could be scheduled first)?