Based on the readings and Learning Module: Network Diagram and Critical path, build a network diagram for the "project" below and answer the questions. Consider the table below as a small project with the letters that represent actual named tasks $($A$-$K$)$ and all durations are in days. You will get an understanding of a predecessor and how this project is going to flow. What tasks can be completed at the same time and how others cannot start until another task is completed. There are times that multiple tasks need to be completed before another one can start.

QUESTIONS: $($of the following questions after you have completed the network diagram$)$

List out each path with total $($in days$).($i$.$e$.,$ A $-$ B $-$ C $-$ D $=10$ days$).$ HINT: there are a total of $5$ paths.

What is the critical path for this project and how long is it$?$ Again, show as above.

When is the earliest possible time that this project can be completed? State in days.