Let `A={a , b , c)` and the relation R be defined on A as follows: `R={(a , a),(b , c),(a , b)}dot` Then, write minimum number of ordered pairs to be added in R to make it reflexive and transitive.

Explanation

To solve the problem, we need to ensure that the relation \( R \) defined on the set \( A = \{ a, b, c \} \) becomes both reflexive and transitive by adding the minimum number of ordered pairs.

### Step 1: Check for Reflexivity
A relation is reflexive if every element in the set is related to itself. This means we need to have the pairs \( (a, a) \), \( (b, b) \), and \( (c, c) \) in \( R \).

**Current pairs in \( R \)**:
- \( R = \{ (a, a), (b, c), (a, b) \} \)

...