Determine whether each of the following is a tautology, a contradiction, or neither ("$$ \vee $$" is disjunction, "$$ \wedge $$" is conjuction, "$$ \to $$" is implication, "$$\neg $$" is negation, and "$$ \leftrightarrow $$" is biconditional (if and only if).

(i)$$\,\,\,\,\,\,A \leftrightarrow \left( {A \vee A} \right)$$
(ii)$$\,\,\,\,\,\,\left( {A \vee B} \right) \to B$$
(iii)$$\,\,\,\,\,\,A \vee \left( {\neg \left( {A \vee B} \right)} \right)$$

The minimum number of colors required to color the vertices of a cycle with $$n$$ nodes in such a way that no two adjacent nodes have the same colour is:

The rank of the matrix$$\left[ {\matrix{ 1 & 1 \cr 0 & 0 \cr } } \right]\,\,is$$

Maximum number of edges in a n - node undirected graph without self loops is