Give an example of a relation that ï¬ts the given requirements.If you think that there is no such relation, you must explain why.In each case, you may not use any of the relations that appearsearlier in this problem set. Unless told otherwise, you may use anyof the following ways of deï¬ning a relation: set-list notation,set-builder notation, or a directed graph.
(a) A relation on {a,b,c,d} that is not reflexive, notantireflexive, and not transitive. You must use set-list notationfor your answer.
(b) A relation on {a,b,c,d} that is not symmetric and notanti-symmetric. You must use a directed graph to deï¬ne thisrelation.
(c) A relation on the set of all text strings that is symmetric,but not transitive. You must use set-builder notation.
Please write each step neatly and nicely.
