How many possible words can be created from the letters R, A, N, D (with repetition)?
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:}
Statement-1: \( \text{ClF}_3 \) has 3 possible structures.
Statement-2: \( \text{III} \) is the most stable structure due to least lone pair-bond pair (lp-bp) repulsion.
Which of the following options is correct?