Let . Let R be a relation on A defined by if and only if . Let be the number of elements in R. Let m and n be the minimum number of elements required to be added in R to make it reflexive and symmetric relations, respectively. Then is equal to
The given set is , so .
Relation is defined by .
Step 1 - List the ordered pairs in
• If (i.e. ), then , hence .
• If (i.e. ), then , hence .
Therefore
The number of elements in is
Step 2 - Make reflexive
A relation is reflexive if for every .
Pairs already present:
Missing reflexive pairs:
Hence the minimum number of pairs to be added is
Step 3 - Make symmetric
A relation is symmetric if
Check each pair in :
• are self-symmetric.
• needs
• needs
• $
These three required pairs are not in , so we must add exactly three of them. Thus
Step 4 - Compute
Therefore, , which corresponds to Option A.
Tagged Reflexive, symmetric and transitive relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.