Consider the following Regis University CS courses offered on Mon., Wed., and Fri. D CS 210 - Introduction to Programming: 9:00a 10:00a CS 310 Data Structures: 9:30a 10:30a CS 324 - Algorithms and Complexity: 10:00a 11:00a CS 390-Principles of Programming Languages: 10:00a-11:00a D CS 473 - Introduction to Artificial Intelligence: 11:30a 12:30p The following CC&IS faculty teach the above courses D A: Professor Smallwood may teach CS 210, CS 310, or CS 324 B: Professor Blumenthal may teach CS 324, CS 390, CS 473 D C: Professor Hart may teach CS 210, CS 390, or CS 473 Naturally, at any given time a single Professor can only teach during one class section period. 4. Create a schedule that assigns these professors to teach all of the previous courses in the given time slots. Frame this as a CSP problem where the courses are the variables. Give the domains and binary constraints