1) Simplify the following function using the laws of Boolean algebra. 2) Write the Boolean Expression for function Z as defined by the following Truth Table in both canonical and simplified forms. Implement function Z using a NOT-AND-OR network. (Please, use straight lines for connections. Use shaded areas to neatly draw your gates.) ABC z 001 0 010 1 011 100 0 110 1 Z (from Table) = Z (simplified)