A natural deduction proof of $\neg (A \leftrightarrow \neg A ) $. I want to prove $\neg (A \leftrightarrow \neg A ) $ in natural deduction: I tried first

But I can't figure how to discharge the hypothesis $A$ and $\neg A$. I then tried

Here I just need to discharge $A \wedge \neg A$, but I can't either figure how to do it.
Edit
Following the help in the answers and comments I came out with

Where $\begin{array}{c} (*) \\ \vdots \\ A \vee \neg A \end{array}$  is a natural deductive proof on its own (needing RAA) of $A \vee \neg A$.
Second method
Without a proof of $A \vee \neg A$:


Once you have shown that $A$ leads to a contradiction, then presumably you can infer $\neg A$ using $\neg$ Intro, and that will discharge $A$. That then also means that you don't have to assume $\neg A$ ... you can just continue working with that $\neg A$. So, not having assumed $\neg A$ in the first place, there is no $\neg A$ to discharge.
