construct a precedence network

Construct a precedence network based on the activity description below. Label activities in the network by their activity letters. Remove any redundant dependencies. Activity H is followed by Activities V, X, L, and Z. Activity precedes Activity and follows the completion of Activities Q.J, and E. The predecessors to Activity N are Activities E, K, and F. Activity O follows Activities D and N, and precedes Activity P. Activity is preceded by Activities T, D, and L. Activity I follows Activity U and precedes Activity Q. Activity U can start when Activities V and X are completed. Activity D follows Activity U. Activity E depends on Activity Land H and precedes Activities T, N, and J. Activity M is preceded by Activities X, L and Z and followed by Activities K and E