title: DeMorgans Law unable to simplify a boolean expression
body: <p>There is a boolean expression <code>(A+B)(AB)'</code>. 
  The answer's truth table compared to this initial have the matching combinations that are resembling one of a XOR gate. I'm wondering if there is an identity or it is possible to further simplify the finished answer into something that resembles a XOR gate. My working out is as follows</p>
  
  <pre><code>(A+B)(AB)'
  = (A+B)(A'+B')
  = AA' + AB' + BA' + BB'
  = 0 + AB' + BA' + 0
  = AB' + BA'
  </code></pre>
  
  <p>Im not sure if this is fully simplified or if there was another path to follow that would give the correct answer. 
  (The initial converted to a circuit will have 4 gates while the "simplified" version will have 5 unless I miscounted)</p>
  
  <p>Thank you in advance</p>