$\bar{A}.\bar{C}+\bar{A}.B+A.\bar{B}.C+B.C$
$=>\bar{A}.\bar{C}+\bar{A}.B+A.\bar{B}.C+\color{Orchid }{(A+\bar{A})
}.B.C$
$=>\bar{A}.\bar{C}+\color{blue}{\bar{A}.B}+\color{green}{A}.\bar{B}.\color{green}{C}+\color{green}{A}.B.\color{green}{C}+\color{blue}{\bar{A}.B}.C$
$=>\bar{A}.\bar{C}+\bar{A}.B+A.C$
From here onwards I tried using $(B+\bar{B})$, $(A+\bar{A})$, and $(C+\bar{C})$ with the terms, but no matter what it all deduce to the last expression only. But the answer has only two terms $\bar{A}.B+C$. How to minimize this further?
Karnaugh map for AB along the top and C on the left:
$\begin {array} {c | c c c c} & 00 & 01 & 11 & 10 \\ \hline 0 & 1 & 1 & 0 & 0 \\ 1 & 0 & 1 & 1 & 1 \\ \end {array}$
The zeros indicate the locations where the equation is not satisfied. So your equation is: $$\lnot (\bar A \bar B C + A \bar C)$$ $$(A + B + \bar C) (\bar A + C)$$
Work backwards now and get your original problem.