The postfix expression for the infix expression A + B * (C + D) / F + D * E is:

A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is:

(a) Consider the relation scheme $$R(A, B, C)$$ with the following functional dependencies:
$$\eqalign{ & A,B \to C \cr & \,\,\,\,\,\,C \to A \cr} $$
Show that the scheme $$R$$ is the Third Normal Form $$(3NF)$$ but not in Boyce-Code Normal Form $$(BCNF).$$

(b) Determine the minimal keys of relation $$R.$$

If the proposition $$\neg p \Rightarrow q$$ is true, then the truth value of the proposition $$\neg p \vee \left( {p \Rightarrow q} \right)$$ where $$'\neg '$$ is negation, $$' \vee '$$ is inclusive or and $$' \Rightarrow '$$ is implication, is