Construct a precedence network based on the same activity descriptions below. Show all your work. Label activities in the network by their activity letters and node numbers. Remove all redundant dependencies and arrange activities in proper sequence steps.Activity Description: Activities H$,$ M and B start the project. The successors to Activity B are Activities K$,$ A$,$ W and J$.$ Activity K also depends on Activity M$.$ Activities U and F follow Activities W and J$,$ and precede Activities E and Q$.$ Activity E is also preceded by Activities C and R$.$ The predecessors to Activity G are Activities L$,$ C and R$.$ Activity C can start after Activities H$,$ K and A are completed. Activity R cannot begin until Activity W is finished. Activity X follows Activity H and precedes Activity L$.$ Activity Y depends on Activities C and R and precedes Activity L$.$