Consider a school with five classes and two periods during which the courses can be scheduled. The classes are named A, B, C, D, and E. Each course must be scheduled in exactly one of the two periods, and the following pairs of courses can not be scheduled at the same time: (E, B), (C, D), (D, A), (B, C), (A, E)

1. Express the scheduling problem as a Boolean expression. That is, give a Boolean expression that is true if and only if there is a feasible schedule for the courses that satisfies all the constraints.

2. Use De Morgan's law to convert the Boolean expression to an equivalent expression in CNF form.

3. Is the Boolean expression satisfiable? Justify your answer.