The negation of the Boolean expression (($$\sim$$ q) $$\wedge$$ p) $$\Rightarrow$$ (($$\sim$$ p) $$\vee$$ q) is logically equivalent to :

Consider the following two propositions:

$$P1: \sim (p \to \sim q)$$

$$P2:(p \wedge \sim q) \wedge (( \sim p) \vee q)$$

If the proposition $$p \to (( \sim p) \vee q)$$ is evaluated as FALSE, then :

Consider the following statements:

A : Rishi is a judge.

B : Rishi is honest.

C : Rishi is not arrogant.

The negation of the statement "if Rishi is a judge and he is not arrogant, then he is honest" is

The number of choices for $$\Delta \in \{ \wedge , \vee , \Rightarrow , \Leftrightarrow \} $$, such that

$$(p\Delta q) \Rightarrow ((p\Delta \sim q) \vee (( \sim p)\Delta q))$$ is a tautology, is :