4. A relation is said to be an _______________________ if it isreflexive, symmetric and transitive.a. Congruence relationb. Binary relationc. N-ary relationd. equivalence relation5. If x and y are rational numbers then x + y ________.a. Is rationalb. Is not rationalc. It can be or can't bed. None of the above6. Binary tree of height n has at most _____ leaves.a. 2nb. 2c. 2nd. n27.
A tree G with „n‟ vertices has ______ edges.
a.(n - 1) (n+ 1)b. (n - 1)c. (n +1)d. n8. which principle can be described by the given statement:If A and B are finite sets and | A | > | B |, then there is no one-to-one function from A to B."a .Proof by inductionb. Proof by contradiction