The negation of the converse of the statement $p \lor q$ is:

If the truth value of the compound statement $[(p \lor q) \land (q \to r) \land (\sim r)] \to (p \land q)$ is $False$, then the truth values of $p \to q$ and $q \to p$ are respectively......

The statement pattern $p \wedge (q \vee \sim p)$ is equivalent to

If $p$: The total prime numbers between $2$ to $100$ are $26$.
$q$: Zero is a complex number.
$r$: Least common multiple ($L$.$C$.$M$.) of $6$ and $7$ is $6$.
Then which of the following is correct?

By giving a counterexample,show that the following statement is false: "If $n$ is an odd integer,then $n$ is prime."

Given $p$: $A$ man is a judge,$q$: $A$ man is honest. If $S_1$: If a man is a judge,then he is honest; $S_2$: If a man is a judge,then he is not honest; $S_3$: $A$ man is not a judge or he is honest; $S_4$: $A$ man is a judge and he is honest. Then: