Sets and Relations question bank (Maths)

Let $\mathrm{A}=\{-2,-1,0,1,2,3,4\}$. Let R be a relation on A defined by $x \mathrm{Ry}$ if and only if $2 x+y \leqslant 2$. Let $l$ 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 $l+m+n$ is equal to :

Let the set $S=\{2,4,8,16, \ldots, 512\}$ be partitioned into 3 sets $A, B, C$ with equal number of elements such that $\mathrm{A} \cup \mathrm{B} \cup \mathrm{C}=\mathrm{S}$ and $\mathrm{A} \cap \mathrm{B}=\mathrm{B} \cap \mathrm{C}=\mathrm{A} \cap \mathrm{C}=\phi$. The maximum number of such possible partitions of $S$ is equal to: