Write the following sets in roster form :

$A = \{ x:x$ is an integer and $ – 3 < x < 7\} $

Assume that $P(A)=P(B) .$ Show that $A=B$.

List all the elements of the following sers :

$F = \{ x:x$ is a consonant in the Englishalphabet which precedes $k\} $

If $Q = \left\{ {x:x = {1 \over y},\,{\rm{where \,\,}}y \in N} \right\}$, then

Let $S=\{1,2,3, \ldots, 40)$ and let $A$ be a subset of $S$ such that no two elements in $A$ have their sum divisible by 5 . What is the maximum number of elements possible in $A$ ?