CS 3304  Home  Syllabus  Grades  Related Links E-Mail Contacts  E-Mail Instructor  E-Mail TA  E-Mail Listserv  Listserv Archive Course Notes  Contents  Search  Topics  Keyword Index Languages  Pascal  Scheme  Prolog  Standard ML Programs  Dates/Guidelines  Submit Program  Program 1 (2/19)  Program 2 (3/19)  Program 3 (4/2)  Program 4 (4/30) Homework  Dates/Guidelines  HW #1 (1/24)  HW #2 (1/31)  HW #3 (2/07)  HW #4 (2/14)  HW #5 (2/21)  HW #6 (2/28)  HW #7 (3/23)  HW #8 (3/30)  HW #9 (4/06)  HW #10 (4/13)  HW #11 (4/20)  HW #12 (5/2)  HW #13 (5/2)			30 Points Due: 2/21/01 at the start of class Complete each of the following problems: Chapter 15, Problem 6 (p. 639). You may not use the predefined union predicate in your solution. If you are testing your answer out using a Prolog interpreter, call your predicate my_union so that it is not confused with the builtin version. Write and test a Prolog implementation of the predicate prefix(A, B) that tests to see if the list A is a valid prefix of the list B: ?- prefix([1,2,3],[1,2,3,4,5]). yes ?- prefix([1,2],[1,a,2,3]). No Write a Scheme implementation of prefix that behaves as closely as possible to this Prolog predicate. In what way(s), if any, is the behavior of your Scheme code different from the behavior of the Prolog code?