how many undirected graphs (not necessarily connected) can be constructed out of a given $$\,\,\,\,V = \left\{ {{v_1},\,\,{v_2},\,....,\,\,{v_n}} \right\}$$ of $$n$$ vertices?

The value of the integral is $${\rm I} = \int\limits_0^{{\raise0.5ex\hbox{$\scriptstyle \pi $} \kern-0.1em/\kern-0.15em \lower0.25ex\hbox{$\scriptstyle 4$}}} {{{\cos }^2}x\,dx} $$

Consider two well-formed formulas in propositional logic
$$F1:P \Rightarrow \neg P$$
$$F2:\left( {P \Rightarrow \neg P} \right) \vee \left( {\neg P \Rightarrow } \right)$$

Which of the following statements is correct?

Which of the following statements is false?