Case I: The four digits are \(2, 2, 2, 3.\)
Total number of arrangements \(= \frac {4!}{3!} = 4\)
Case II: The four digits are \(2, 2, 3, 3.\)
Total number of arrangement \(= \frac {4!}{2!.2!} = 6\)
Case III: The four digits are \(2, 3, 3, 3.\)
Total number of arrangements \(=\frac {4!}{3!} = 4\)
Case IV: The four digits are \(2, 3, 3, 1. \)
Total number of arrangements \(= \frac {4!}{2!} = 12\)
Case V: The four digits are \(2, 2, 3, 1.\)
Total number of arrangements \(= \frac {4!}{2!} = 12\)
Case VI: The four digits are \(2, 3, 1, 1.\)
Total number of arrangements \(= \frac {4!}{2!} = 12\)
So, total possible ways \(= 12+12+12+4+6+4 = 50\) ways.
Let R = {(1, 2), (2, 3), (3, 3)} be a relation defined on the set \( \{1, 2, 3, 4\} \). Then the minimum number of elements needed to be added in \( R \) so that \( R \) becomes an equivalence relation, is:}