Homework #2. Problem 1. Jones, Smith and Clark hold the jobs of programmer, knowledge engineer, and manager (not necessarily in that order). Jones owes the programmer $10. The manager's spouse prohibits borrowing money. Smith is not married. Figure out which person has which job. Represent the facts in PL. You should have nine propositions to represent the possible person/job assignments. Ex. SM (Smith is a manager), or ~SM (Smith is not a manager). The possible answers to the problem are sentences like JP & SK & CM. There are six such combinations of person/job assignments. Show that only one of them is applied by the KB. Use KM* to derive the solution. Problem 2. Use the code for the Boston subway problem to represent a (simplified) map of Connecticut roads and cities. Give example runs of the code, assuming that you want to go from city A to city B. Submit a hard copy of the code, the disk with the code and the example runs.