1. Consider the following project in AoN format: construct the priority list that is based on the following priority rules (uses smallest activity number as a tie-breaker) Requirements: For the serial schedule generation scheme, give the set PSG, ED, and activity start time (for those activities that are already scheduled) in each iteration g; LST LFT MSLK MTS . GRPW GRPW* . GCUMRD 2 Availability = 10 0 12 0 0 5 2 7 4 11 6 1. Consider the following project in AoN format: construct the priority list that is based on the following priority rules (uses smallest activity number as a tie-breaker) Requirements: For the serial schedule generation scheme, give the set PSG, ED, and activity start time (for those activities that are already scheduled) in each iteration g; LST LFT MSLK MTS . GRPW GRPW* . GCUMRD 2 Availability = 10 0 12 0 0 5 2 7 4 11 6