Given the following activities with listed durations and predecessor constraints, draw a schedule network diagram. Assume all dependency relationships are Finish-to-Start dependencies. Determine the length of the schedule. Identify the critical path. For each node, identify the total schedule slack.