Consider the problem of generating a set of (linearized) schedules for a set of partially ordered atomic actions. For two actions A and B, denote by A ? B the constraint that A should occur before B.
a. If there are n actions that all have to be performed, what is the smallest number of schedules that might be generated. What about the largest number?
b. If there are four actions A, B, C and D with constraints A ? B and A ? C, write down all the possible schedules (as list of actions). What happens if we add the constraint that B should not occur after D?