Write a function two in Scheme that takes a single parameter, a list of integers. The function two returns #t if the list of integers includes two equal integers. Otherwise, it returns #f. The list L...

Write a function two in Scheme that takes a single parameter, a list of integers. The function two

returns #t if the list of integers includes two equal integers. Otherwise, it returns #f. The list L is

flat, i.e., it does not contain sublists.

Note that the function must be called two and that it takes a single parameter, a list.
Examples

(two ‘(7 7)) returns #t

(two ‘(5 3 3 4)) returns #t

(two ‘(11 3 5 11)) returns #t

(two ‘(1 2 3 4 5 6 10)) returns #f

(two ‘(24 14 11 4 6)) returns #f



The whole solution must be packed in one recursive function two which must look as follows: (define two (lambda (list)

(cond

...

)))

In other words, you have to define a single COND statement. Nested COND statements are not

allowed.

Inside COND, you can use ONLY the following constructs: - null?

- car

- cdr

- cons

- else

- =

- #t

- #f

- two

- list