After providing one eraser to each of the 4 kids, there are 3 erasers remaining. The distribution can be done in either 2, 1, or 1, 1, 1 manner (no kid can receive 4 erasers).
There are a total of 4P2+4C3, which equals 16 ways of distributing the erasers.
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:}