We schedule lectures L1--L5 on Mon--Fri, and assign professors A--E (each exactly once).
Step 1: A must teach L3.
So L3 is fixed on whichever day A is assigned.
Step 2: Order restriction L2 after L5.
Valid (L5, L2) day-pairs:
(Mon,Tue), (Mon,Wed), (Mon,Thu), (Mon,Fri),
(Tue,Wed), (Tue,Thu), (Tue,Fri),
(Wed,Thu), (Wed,Fri),
(Thu,Fri).
A total of 10 possible placements.
Step 3: Professor restrictions.
C cannot teach on Wed or Fri -- C must be Mon/Tue/Thu.
B cannot teach L4 -- whichever day L4 lands on cannot get B.
D must teach before E -- day(D) < day(E).
Step 4: Combine lecture placements with professor placements.
For each of the 10 valid positions of (L5, L2), we must assign:
- L3 to A.
- Remaining lectures L1, L4, L5, L2 to professors B, C, D, E respecting rules.
In each arrangement:
• C may be assigned only if the lecture day is Mon/Tue/Thu.
• B cannot take L4.
• D and E must satisfy the day order.
Careful counting case-by-case (over each of the 10 allowed (L5, L2) placements) gives:
\[
\text{Total valid schedules} = 18.
\]
Final Answer: 18