Problem 3 Let X be the set of names of the integers from zero to nine, so that X = {zero, one, two, ..., nine}. Let R be

[answerhappygod]

Problem 3 Let X Be The Set Of Names Of The Integers From Zero To Nine So That X Zero One Two Nine Let R Be 1 (30.44 KiB) Viewed 25 times

Problem 3 Let X Be The Set Of Names Of The Integers From Zero To Nine So That X Zero One Two Nine Let R Be 2 (66.98 KiB) Viewed 25 times

Please answer all parts of the
problem and show all work.
Thank you!
Problem 3 Let X be the set of names of the integers from zero to nine, so that X = {zero, one, two, ..., nine}. Let R be the relation such that two names x and y are related if they have the same number of letters.

a) Describe R using any two of the following four methods: • as a set with an explicit list of elements as a set described with set builder notation • as a diagram with dots and arrows • as a shaded region in a cartesian-type plane b) Prove that R is an equivalence relation. c) Describe the equivalence classes of R and the corresponding partition of X. d) Prove or disprove that R is a function from X to X.