What is the maximum number of different Boolean functions involving $$n$$ Boolean variables?

Let $$S$$ be a set6 of $$n$$ elements. The number of ordered pairs in the largest and the smallest equivalence relations on $$S$$ are

For the set $$N$$ of natural numbers and a binary operation $$f:N \times N \to N$$, an element $$z \in N$$ is called an identity for $$f$$ if $$f\left( {a,z} \right) = a = f\left( {z,a} \right)$$ for all $$a \in N$$. Which of the following binary operations have an identify?
$${\rm I}$$) $$\,\,\,\,\,\,f\left( {x,y} \right) = x + y - 3$$
$${\rm I}{\rm I}$$ $$\,\,\,\,\,\,f\left( {x,y} \right) = {\mkern 1mu} \max \left( {x,y} \right)$$
$${\rm I}{\rm I}{\rm I}$$$$\,\,\,\,\,f\left( {x,y} \right) = \,{x^y}$$

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