Find the simplest form of the following switching circuit.

In a regular graph of $15$ vertices,the sum of the degrees of the vertices is $60$. Then,the degree of each vertex is:

Let $A$ and $B$ be finite sets and $P_A$ and $P_B$ respectively denote their power sets. If $P_B$ has $112$ elements more than those in $P_A$,then the number of injective functions from $A$ to $B$ is

For a real number $x$,$[x]$ denotes the greatest integer less than or equal to $x$. The value of $\left[ \frac{1}{2} \right] + \left[ \frac{1}{2} + \frac{1}{100} \right] + \left[ \frac{1}{2} + \frac{2}{100} \right] + \dots + \left[ \frac{1}{2} + \frac{99}{100} \right]$ is

Let $A = \{x \in (0, \pi) - \{\frac{\pi}{2}\} : \log_{(2/\pi)}|\sin x| + \log_{(2/\pi)}|\cos x| = 2\}$ and $B = \{x \geq 0 : \sqrt{x}(\sqrt{x} - 4) - 3|\sqrt{x} - 2| + 6 = 0\}$. Then $n(A \cup B)$ is equal to:

If $U$ is the universal set and $A \cup B \cup C = U$, then ${(A - B) \cup (B - C) \cup (C - A)}'$ is equal to: