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 (9/29)  Program 2 (10/24)  Program 3 (11/14)  Program 4 (12/10) Homework  Dates/Guidelines  HW #1 (9/5)  HW #2 (9/12)  HW #3 (9/19)  HW #4 (9/24)  HW #5 (10/1)  HW #6 (10/8)  HW #7 (10/22)  HW #8 (10/31)  HW #9 (11/5)  HW #10 (11/12)  HW #11 (11/26)  HW #12 (12/3)  HW #13 (12/12)			25 Points Due: 9/19/01 at the start of class Complete each of the following problems: Write a Scheme function that returns the intersection of two simple list parameters that represent sets. Chapter 15, Problem 2 (p. 627 of 5E text, in 4E: Chapter 14, Problem 2 on p. 602): Write your own implementation of the Scheme built-in function sublist: (sublist list start end) Returns a newly allocated list formed from the elements of list beginning at index start (inclusive) and ending at end (exclusive). You may assume that start and end are integers that satisfy: 0 <= start <= end <= (length list) Name your function my-sublist, since sublist is already provided as a standard operation in Scheme (you may not use sublist, list-head, or list-tail in your solution).