31. Can you find an order-requirement digraph with four tasks for which every possible list yields exactly the same schedule?