Consider the following project network applying PERT/CPM as described, where the number over each through this network from start to finish, since the longest path is node is the time required for the corresponding activity. Consider the problem of finding the longest path (the largest total time) the critical path.

hope it you

step-by-step explanation:

sin(7pi/6 - pi/3)  

= sin(7pi/6 - 2pi/6)  

= sin(5pi/6)  

= sin(pi - pi/6)  

= sin(pi/6)  

= 1/2  

sin 7pi/6 - sin pi/3  

= sin (pi + pi/6) - sin pi/3  

= -sin pi/6 - sin pi/3  

= -1/2 - sqrt(3)/2  

= -(1+sqrt(3))2

b. is true. hope this . happy

d will be the best answer

61.7% of the boys chose fishing