Please write the program in Scheme.
Cessfon
CSCI 3210 Project 4 Due: see class calendar
Goal: To learn how to use a functional programming language to solve a problem
Description: In this assignment, you are required to write functions specified below in Scheme, one of the functional programming languages. Write a non-recursive Scheme function area(r) that, given the radius r of a circle, computes its area as 3.14*r*r. Write a recursive Scheme function power(A, B) that takes two integer parameters, A and B, and returns A raised to the B power. A must be a positive value, but B may be a negative value. Write a recursive Scheme function countZero(list) that returns the number of value zeros in a given simple list of numbers. For example, (countZero 1 023 0) should return 2. Write a recursive Scheme function reverse(list) that returns the reverse of its simple list parameter. For example, (reverse 1 23 a b) should return (b a 3 2 1). Write a recursive Scheme function palindrome(list) that returns true if the simple list reads the same forwards and backwards. For example, (palindrome a b c) returns true, while (palindrome a b c a) returns false. Write a recursive Scheme function merge(firstNameList, lastNameList) that receives a simple list of first names and a simple list of last names, and merges the two lists into one list consisting of (firstName lastName) pairs. Display the result list. For example, if the inputs are (John Kim Kate George) and (Davidson Hunter Johnson Olson), the output should be ((John Davidson) (Kim Hunter) (Kate Johnson) (George Olson)).
Note: A simple list is a list such that none of its elements is a list. For example, (1 2 3) is a simple list, while (1 23) is not.
To avoid typing long lists at the command line, I suggest you create a few sample arguments in files:
> (load "my_lists")
> (countZero list1)
where the file my_lists contains the definition define list1 '(1 9 0 12 0 30 50 0)
Important: You are required to use only the functional features of Scheme; functions with an exclamation point in their names (e.g. set!) and input/output mechanisms other than Toad and the regular read-eval-print loop are not allowed. (You may find imperative features useful for debugging. That's ok, but get them out of your code before you hand anything in.)
Requirement: All functions should be put within the same source file with the given signature.
