term1.txt:

3 DrLight Sparkman Snakeman Needleman Hardman Topman Geminiman Magnetman Shadowman DrWily Bubbleman Airman Quickman Heatman Crashman Metalman Flashman Woodman DrCossack Heatman Quickman Magnetman DrCain Quickman Sparkman Bubbleman DrCiel Airman Sparkman Needleman DrKalinka Geminiman Bubbleman Flashman

By hand, without using any program, formalize the instance of the Robot University problem that is found in term1.txt. This means that you must describe all of the following: 1. List all Variables in the problem 2. List the Domains of each variable 3. Give an example of assigning a value to a variable using your specification and explain what that assignment would mean with regard to the problem 4. List all constraints for the problem, using the explicit tuple format - i.e. for each constraint: - List which variables are involved in the constraint - Show the set-of-tuples of allowed values for those variables Since the constraints in this problem are quite simple and can be summarized using a well-known mathematical operator, listing the set of allowed tuples will likely seem quite tedious. Too bad. Do it anyway. Describing a CSP by hand, especially when using the fully general explicit tuple format for the constraints, can be a bit tedious. Thus, your task for this question is to write a program that can read a Robot University problems from file, and automatically output the matching CSP formalization. Essentially, this is simply automating the process that you did by hand for the previous question. Run your program on all of the provided Robot University problems to make sure it works. But you do not need to hand in any of this output