The shortest time necessary to complete all of the activities in a network is called the:

a. Activity duration length

b. Critical path

c. Maximum slack path

d. Compression path