A logical binary relation $$ \odot $$, is defined as follows:

Let ~ be the unary negation (NOT) operator, with higher precedence then $$ \odot $$. Which one of the following is equivalent to $$A \wedge B?$$

Let S = {1, 2, 3,....., m} , m > 3. Let $${X_1},\,....,\,{X_n}$$ be subsets of S each of size 3. Define a function f from S to the set of natural numbers as, f (i) is the number of sets $${X_j}$$ that contain the element i. That is $$f(i) = \left\{ {j\left| i \right.\,\, \in \,{X_j}} \right\}\left| . \right.$$

Then $$\sum\limits_{i - 1}^m {f\,(i)} $$ is

Let $$X,. Y, Z$$ be sets of sizes $$x, y$$ and $$z$$ respectively. Let $$W = X x Y$$ and $$E$$ be the set of all subjects of $$W$$. The number of functions from $$Z$$ to $$E$$ is

A relation $$R$$ is defined on ordered pairs of integers as follows: $$\left( {x,y} \right)R\left( {u,v} \right)\,if\,x < u$$ and $$y > v$$. Then $$R$$ is