The relation R is defined in the set {1, 2, 3, 4, 5, 6} as R={(a,b):b=a+1}, then R is neither reflexive nor symmetric nor transitiveR is neither reflexive nor symmetric but transitiveR is not reflexive but symmetric and transitiveR is reflexive, symmetric and transitive

The relation R is defined as R={(a,b):b=a+1}. This means that for any pair (a, b) in R, b is always one more than a.

1. Reflexive: A relation is reflexive if every element is related to itself. In this case, there is no pair (a, a) such that a = a + 1. Therefore, R is not reflexive.

2. Symmetric: A relation is symmetric if for every pair (a, b) in R, (b, a) is also in R. In this case, if (a, b) is in R (meaning b = a + 1), then (b, a) would mean a = b + 1, which is not true. Therefore, R is not symmetric.

3. Transitive: A relation is transitive if for every pair of elements (a, b) and (b, c) in R, (a, c) is also in R. In this case, if (a, b) and (b, c) are in R (meaning b = a + 1 and c = b + 1), then c = a + 2, not a + 1. Therefore, R is not transitive.

So, the relation R is neither reflexive, nor symmetric, nor transitive.

The relation R is defined as R={(a,b):b=a+1}. This means that for every pair (a, b) in R, b is always one more than a.

1. Reflexive: A relation is reflexive if every element is related to itself. In this case, there is no pair (a, a) such that a = a + 1. Therefore, R is not reflexive.

2. Symmetric: A relation is symmetric if for every pair (a, b) in R, (b, a) is also in R. In this case, if (a, b) is in R, then b = a + 1. But this does not imply that (b, a) is in R, because a ≠ b + 1. Therefore, R is not symmetric.

3. Transitive: A relation is transitive if for every pair of pairs ((a, b), (b, c)) in R, (a, c) is also in R. In this case, if (a, b) and (b, c) are in R, then b = a + 1 and c = b + 1. This implies that c = a + 2, not a + 1, so (a, c) is not in R. Therefore, R is not transitive.

So, the correct answer is "R is neither reflexive nor symmetric nor transitive".