Implement the following Racket functions: Reflexive?  Input: a list of pairs, L and a list S.  Interpreting L as a binary relation over the set S, Reflexive? returns #t if L is a reflexive relation over the set S and #f otherwise. Examples: (display "Reflexive?\n") (Reflexive? '((a a) (b b) (c c)) '(a b c)) ---> #t (Reflexive? '((a a) (b b)) '(a b c)) ---> #f (Reflexive? '((a a) (a s) (b b) (c c)) '(a b c)) ---> #f (Reflexive? '() '()) ---> #t

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Implement the following Racket functions:

Reflexive? 

Input: a list of pairs, L and a list S.  Interpreting L as a binary relation over the set S, Reflexive? returns #t if L is a reflexive relation over the set S and #f otherwise.

Examples:

(display "Reflexive?\n")

(Reflexive? '((a a) (b b) (c c)) '(a b c)) ---> #t

(Reflexive? '((a a) (b b)) '(a b c)) ---> #f

(Reflexive? '((a a) (a s) (b b) (c c)) '(a b c)) ---> #f

(Reflexive? '() '()) ---> #t

You must use recursion, and not iteration. You may not use side-effects (e.g. set!). 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Linked List Representation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education