Given the following truth-table describing a boolean function F(X,Y,Z):

Synthesize the combinational function with two functionally equivalent networks: the first one realized as sum of products (AND-OR) and the second one as product of sums (OR-AND). To verify the equivalence of the two networks, draw them in the d-DcS. A schematic template is available (click on the figure to open it in the d-DcS):

Perform a timing simulation of the two nets, including all possible combinations of the inputs X, Y and Z (a suitable test sequence is available in the Timing Diagram window).