in c$++$ pls solve and dont use chat gbt

$(1)$ For the following statement, produce a gate diagram. $(20$ pts$.$ each$)$

$($A nand B$)$ implies $(!$B xor $($B implies C$))$

$(2)$ Turn the follow phrases into logical statements. Use the capitalized words as your variables. $(10$ pts$.$ each$)$

$(2\mathrm{.}1)$ Either you can go to the MOVIES, or you can obey QUARANTINE $($but you can't do both!$)$

$(2\mathrm{.}2)$ If Charlie finds a WATCH, then he will not be LATE.

$(2\mathrm{.}3)$ Steve doesn't have a CAT nor does he have a DOG, and Steve's not very SOCIAL.

$(2\mathrm{.}4)$ If I get out to a RESTAURANT, then I$\text{'}$m expecting to have a nice MEAL or good SERVICE.

$(3)$ State the logical equivalences needed in order to turn one of these statements into the other. $(20$ pts$.)$

Statement $1$: $(!$A or $(!$B and $!$C$))$ and $($B or $!$B$)$

Statement $2$: $($A nand $($B or C$))$

$(4)$ Determine if the following logical statement is valid via truth table: $(20$ pts$.)$

Prop A$.$ Steve can exclusively either Study or Sleep.

Prop B$.$ If Steve studies, then he'll Pass his Exam.

Conclusion: If Steve Sleeps, then he'll NOT Pass his Exam.