Match List-I with List-II. Suppose \(A, B, C\) are three non-empty sets.
List-I:
A. De-Morgan's Law,
B. Associative Law,
C. Distributive Law,
D. Difference of sets Law.
Let \( A = \{-3, -2, -1, 0, 1, 2, 3\} \). A relation \( R \) is defined such that \( xRy \) if \( y = \max(x, 1) \). The number of elements required to make it reflexive is \( l \), the number of elements required to make it symmetric is \( m \), and the number of elements in the relation \( R \) is \( n \). Then the value of \( l + m + n \) is equal to: