Problem $3$ Project Management

A company needs to visualize the task dependencies in a complex project. Each node in the DAG represents a task, and an arrow from node $1$ to node $2$ means

that the task represented by the first node must be completed before the task represented by the second node can be started.

Here is a list of the tasks for one of the projects, along with the dependencies between them:

Task A: No dependencies

Task B: Dependent on Task A

Task C: Dependent on Task A

Task D: Dependent on Task B and Task C

Task E: Dependent on Task D

Your task is use Python to draw a DAG to represent these dependencies, and then analyze it to determine the order in which the tasks must be completed.