Please help! I need help with both parts please!

Solve the following network and utilizing the series method of allocating resources.

B E H 3 5 3 2M,1H 3M,OH 1M,1H A C F J 1 2 7 1 2M,1H 2M,1H 2M,2H 2M,1H Activity ES Dur LS EF FF TE LF Res D G 6 3 6 1M,OH 2M,OH 3M,2H RESOURCE ALLOCATION Act Resource Dur TF LS Stat 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 Maximum 5 Masons Schedule Maximum 2 Helper Schedule Rules: (Series) 1. Schedule activities to start as soon as their predecessors have been completed 2. If more than one activity using a specific limited resource can be scheduled, priority is given to the activity with the ealriest late start. 3. If the activities are tied for the early late start date, give priority to the activity with the least total float 4. If the activities are tied for the total float, give priority to the activity with the largest number of resources. 5. If no activity has been selected with the above rules simply start the activity that occurs first in the input order. 6. Once an activity is started, it cannot be interrupted