Simplying boolean function...

[tqp13]

Could someone please help me in simplifying this Boolean function:

F = [ (A + B * C) + (A' * B) ] '

I went over all the simplification theorems and I can't seem to find a way to simplify this. I'll appreciate any help...

 

[lostinxlation]

Karnaught map.

      00 01  11   10  (AB)
----+---+---+---+--------
  0 | 1   0    0    0
  1 | 1   0    0    0
----+----------------------
 (C)

if you want to simplify by De Morgan's, use A+A'*B = A + B and B*(C+1)=B.