Language Scheme (Racket)
Input: a list of pairs, L. Interpreting L as a binary relation,Symmetric? returns #t if L is a
symmetric relation and #f otherwise.
Examples:
(Symmetric? ‘((a a) (a b) (b a) (b c) (c b))) —> #t
(Symmetric? ‘((a a) (a b) (a c) (c a))) —> #f
(Symmetric? ‘((a a) (b b))) —> #t
(Symmetric? ‘()) —> #t
Expert Answer
Answer to Language Scheme (Racket) Input: a list of pairs, L. Interpreting L as a binary relation, Symmetric? returns #t if L is a…