The following function is the only minimum sum of products expression. Implement it using only two-input NAND gates. No gate may be used as a NOT gate. Show both the block diagram and the equation. Assume that all inputs are available both uncomplemented and complemented. (Full credit for 13 gates; partial credit if you use one three-input gate or 14 or 15 two-input gates.) F = A' E' + A' C' + ABCD + B' C E' + C' D' E + B' C' D