How do I solve this Derivation Proof in Logic ¬A → [(B ∧ A) → C]?

Question

I have attempted to solve this question multiple times but keep getting it wrong. Im only allowed to use Conjunction Introduction/Elimination, Conditional Introduction/Elimination, Negation Introduction/Elimination, Disjunction Introduction/Elimination, and Biconditional Introduction/Elimination.

Answer 1

well if ~A holds then (B and A) is FALSE

so then, (B and A)-->C = False --> C = True, regardless of

whether C is true or false

=========================

usually, a prove has an equal sign and the proof is to show that the left side

is equal to the right side