Counting Topological Sortings of a Six-Node Layered DAG

Question 1

Find the total number of topological sortings in the following graph. The directed graph has 6 nodes and the edges 1 -> 4, 2 -> 4, 2 -> 5, 3 -> 4, 3 -> 5, 4 -> 6 and 5 -> 6.