Let S be the set of all strings of 0's and 1's of length 4, and let A, B, and C be the following subsets of S: A ={1001, 0011, 0100, 0111} B = {1110, 0100, 0110, 1001} C={1001, 0011, 0110, 1111} Find (AUB) - C (select the correct answer) ○ {1001} ○ {1001, 0100} O {1001, 0011, 0110} {0100, 0111, 1110} ○ Ø O {0100, 0111, 1110, 1111}

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter1: Fundamentals
Section1.7: Relations
Problem 4E: 4. Let be the relation “congruence modulo 5” defined on as follows: is congruent to modulo if...
icon
Related questions
Question
Let S be the set of all strings of 0's and 1's of length 4, and let A, B, and C be the following subsets of S:
A = {1001, 0011, 0100, 0111}
B = {1110, 0100, 0110, 1001}
C={1001, 0011, 0110, 1111}
Find (AUB) - C
(select the correct answer)
○ {1001}
○ {1001, 0100}
O {1001, 0011, 0110}
{0100, 0111, 1110}
0
O {0100, 0111, 1110, 1111}
Transcribed Image Text:Let S be the set of all strings of 0's and 1's of length 4, and let A, B, and C be the following subsets of S: A = {1001, 0011, 0100, 0111} B = {1110, 0100, 0110, 1001} C={1001, 0011, 0110, 1111} Find (AUB) - C (select the correct answer) ○ {1001} ○ {1001, 0100} O {1001, 0011, 0110} {0100, 0111, 1110} 0 O {0100, 0111, 1110, 1111}
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer