If we use the same circuit from thiese notes:
https://digsys.upc.edu/csd/P01/P1_C/Circuit_C_method_III.pdf 

This is W
1) 
truth table not(D1) and A and B

2) 
truth table not(not(D1) and A and B)


3)
 truth table not (not(A) or B) and not(D0)

4)
 truth table not (not(A) or B) and not(D0)


5) not(not (not(A) or B) and not(D0)) 

Circuit_W
6) truth table not(not(D1) and A and B)  and not(not (not(A) or B) and not(D0)) 


This is T


1) truth table not(not(not(D1) or D0 or A))
logic circuit not(not(not(D1) or D0 or A))

This is Z
1) (((not(D0) or A) and not(B) ) or A ) or (B and D0)

Finally C:

(T and Z)
truth table (not(not(not(D1) or D0 or A))) and ((((not(D0) or A) and not(B) ) or A ) or (B and D0))

C = W and (T and Z) 
truth table (not(not(D1) and A and B)  and not(not (not(A) or B) and not(D0))) and ((not(not(not(D1) or D0 or A))) and ((((not(D0) or A) and not(B) ) or A ) or (B and D0)))