This questionis to design eight finite relations. Let D = {1, 2, 3}. We can think of a binary relation on D as a subset of D D. For example, the identity relation is {(1, 1),(2, 2),(3, 3)}. There are 9 elements in DD, so there are 2^9 = 512 different binary relations on D.

Construct eight of these, r0, . . . , r7, satisfying the criteria given in the table below.Each relation should be presented as [(Int,Int)].

For full marks, each relation has to be as small as it can be.

Reflexive Symmetric Transitive no no es yes no no yes es no no no no yes yes yes no es no es no es no es To T2 T3 T4 T5 T6 es