(2 points) Formulate as CSP the following scheduling problem. You are given n courses (E.g. CSC110, CSC115, ..., CSC421,...), which are needed for one to graduate, and are asked to create a schedule for taking the courses, subject to the following constraints: A. Courses might have prerequisite courses that need to be taken before. B. Some courses are offered in certain terms onlv C. We want to take not more than 4 courses per term D. Time conflicts should be avoided. Only the formulation is required for this question (no program required) Hint. For example, we might pick the terms as the variables. In that case, the values are cpmbinations of four courses that are consistent, meaning that they are offered in the same term and whose times don't conflict. The prerequisite constraint would relate every pair of terms and would require that no course appear in a term before that of any of its prerequisite course. This perfectly valid formulation has the practical weakness that the domains for the variables are huge, which has a dramatic effect on the running time of the algorithms. One way of avoiding the combinatorics of using 4-course schedules as the values of the variables is to break up each term into "term slots." Then, we can turn things around and use the courses themselves as variables and use (term-termslot timeslot) triples as the values. Now write a sample of the domains and formalize the constraints (2 points) Formulate as CSP the following scheduling problem. You are given n courses (E.g. CSC110, CSC115, ..., CSC421,...), which are needed for one to graduate, and are asked to create a schedule for taking the courses, subject to the following constraints: A. Courses might have prerequisite courses that need to be taken before. B. Some courses are offered in certain terms onlv C. We want to take not more than 4 courses per term D. Time conflicts should be avoided. Only the formulation is required for this question (no program required) Hint. For example, we might pick the terms as the variables. In that case, the values are cpmbinations of four courses that are consistent, meaning that they are offered in the same term and whose times don't conflict. The prerequisite constraint would relate every pair of terms and would require that no course appear in a term before that of any of its prerequisite course. This perfectly valid formulation has the practical weakness that the domains for the variables are huge, which has a dramatic effect on the running time of the algorithms. One way of avoiding the combinatorics of using 4-course schedules as the values of the variables is to break up each term into "term slots." Then, we can turn things around and use the courses themselves as variables and use (term-termslot timeslot) triples as the values. Now write a sample of the domains and formalize the constraints