A project consists of eleven activities, AK. The durations (in days) of the activities, and the precedence relations, are given in the following table. (a) Using the activity network algorithm in Networks 2, construct an activity network for this project. (b) List any redundant arcs in your activity network. (You should ignore them when applying the subsequent algorithms.) (c) Using the critical path construction algorithm in Networks 2, compile a table showing the earliest starting time for each activity. Hence find a critical path in the activity network, and state the length of this path