Intro To discrete math

\fLet -> = {(v,v') E V x V | P(v, v')}. We will use an inx notation for this relation and write 1} w 11' instead of (11,11') 6w. We also write 1} 71+ 11' instead of (v,v') 9} for the negation of v w 11'. Exercise 3. Answer the following questions, each time proving your claim: 1. Is w reexive? 4, Is w transitive? 2. Is w symmetric? 5. Is w an equivalence relation? 3. Is w antisymmetric? 6. Is I9 an order relation? If yes, is it total? Note: In this exercise we consider w not over a particular graph, but in general. So when the answer is yes, a proof must be for any graph, but when the answer is no, a counterexample can be from a particular graph (from go for instance)