Let A = { 1 , 2 , 3 } then the total number of relations containing ( 1, 2) and (2 , 3) which are reflexive and transitive but not symmetric are

2 4 3 5

3

Start with smallest relation R , which is reflexive and tansitive but not symmetric then extend R1 to R2 such that R2 contains R1 and R2 is reflexive and transitive but not symmetric. Count all such possible relations.