Here's a DNF: $$(\neg A_1 \land \neg A_2 \land \neg A_3 ) \lor (A_1 \land \neg A_2 \land \neg A_3 ) \lor (\neg A_1 \land \neg A_2 \land A_3 ) \lor (\neg A_1 \land A_2 \land \neg A_3 )$$
And the problem states "Find a wff for this DNF in which there are at most 5 connective symbols."
I've spent the past hour distributing & using De Morgan's laws and I'm not really getting anywhere. Is there some obvious process that I am missing here?