Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________
(a) reflexive
(b) transitive
(c) symmetric
(d) reflexive and transitive
This question was addressed to me during a job interview.
This is a very interesting question from Finite Automata-Introduction in chapter Finite Automata of Automata Theory