Strictly following the precedence i.e (. before +)
A.B.C  + A. B (not A . not C) (De morgans law)
A.B.C + A.B.notA.notC
A.B.C + (A.notA).B.notC

A and not A = False

ABC + False

so if any of the A or B or C is false the result is False and for the expression to be true they all have to be True

I am assuming that the bnot.(A+C) = b.not(A+C)

Please consult the solution below, the above is solved on wrong assumption :D