A freshman entering the computer science department in Spring 2021 at JSU is trying to plan the classes that he will take in order to graduate in Fall 2024 (i.e., 8 semesters). He must complete a set R of required courses, which is a subset of the complete set of courses C, in order to obtain his B.S. degree in Computer Science. In addition, for each course c C, there is a set of prerequisites Prereg(c) c Cand a set of semesters Semesters(c) CS that will offer. Note that S = {1, 2, 3, ..., 8} standing for a complete set of 8 semesters. A maximum of 4 courses can be taken each semester. Answer the following questions. a. b. This course scheduling problem is a constraint satisfaction problem. Specify the set of variables, the domain for each variable, and the set of constraints, which are not limited to unary and binary constraints. Now the student wants to find a schedule that will allow him to graduate in as few semesters as possible. With such an additional objective, formulate this problem as an uninformed search problem with State Space: The set of all (or partial) assignments x to the CSP Start state: Goal test: The assignment is a complete, consistent assignment to the CSP. Successor function: Successors(x) = ???? (fill in your answer) Cost function: Cost(x,x) = ??? (fill in your answer) Instead of using uninformed search on the formulation in b., how could you modify backtracking search to efficiently find the least-semester solution? . . . . c. A freshman entering the computer science department in Spring 2021 at JSU is trying to plan the classes that he will take in order to graduate in Fall 2024 (i.e., 8 semesters). He must complete a set R of required courses, which is a subset of the complete set of courses C, in order to obtain his B.S. degree in Computer Science. In addition, for each course c C, there is a set of prerequisites Prereg(c) c Cand a set of semesters Semesters(c) CS that will offer. Note that S = {1, 2, 3, ..., 8} standing for a complete set of 8 semesters. A maximum of 4 courses can be taken each semester. Answer the following questions. a. b. This course scheduling problem is a constraint satisfaction problem. Specify the set of variables, the domain for each variable, and the set of constraints, which are not limited to unary and binary constraints. Now the student wants to find a schedule that will allow him to graduate in as few semesters as possible. With such an additional objective, formulate this problem as an uninformed search problem with State Space: The set of all (or partial) assignments x to the CSP Start state: Goal test: The assignment is a complete, consistent assignment to the CSP. Successor function: Successors(x) = ???? (fill in your answer) Cost function: Cost(x,x) = ??? (fill in your answer) Instead of using uninformed search on the formulation in b., how could you modify backtracking search to efficiently find the least-semester solution? . . . . c