1. Construct two separate networks (an activity on arrow AOA and an activity on node AON) according to the activity description below. Label activities by their letters and node numbers. In the case of the AON network, remove redundant relationships and arrange activities in proper sequence steps. Show all cycles and calculations. Activities A and B has no predecessors. Activity B immediately precedes Activities H, J, and N. Activities B and N must be finished before Activity K can star. Activities C, F, and H must be complete before Activity D can start. Activities C and F immediately follow Activity A. Activity M cannot start until Activity J is finished. Activities G and K can be done at the same time. Activity G depends upon the completion of Activities C, F, H, J, and N. Activity E cannot start until Activities A, C, and D have ended Activity M depends upon Activities G and K. Activity M must follow Activity A