Evaluate the truth value of the following Quantified Boolean Formula (QBF): ∀x∃y∀z[((x∧y)∨(¬x∧z)) ⟹ (y⊕z)]\forall x \exists y \forall z [((x \land y) \lor (\neg x \land z)) \implies (y \oplus z)]∀x∃y∀z[((x∧y)∨(¬x∧z))⟹(y⊕z)]
True, and the winning strategy for the existential player is always to choose y=0y = 0y=0
True, and the winning strategy for the existential player is always to choose y=1y = 1y=1
False, because the universal player can force a contradiction by choosing z=1z = 1z=1
False, because the universal player can force a contradiction by choosing z=0z = 0z=0