i need just b and f only

26. Implement each of the following expressions (which are already in minimum sum of products form) using only two-input NAND gates. No gate may be used as a NOT. All inputs are available both uncompletnented and complemented. (The number of gates required is shown in parentheses.) *a. f= wy' + wxz + y'z + w'x'z (7 gates) b. ab' + bde' + bc' d + a' ce (10 gates) c. H= A'B'E + A'B'CD' + B'DE + BDE + BCE + ACE (14 gates) *d. F= A'B'D + ABC + B'CD E + A'B'C+ BCD (11 gates) G= B'DE + A'BC D + ACE + ACE + B'CE (12 gates, one of which is shared) h= b' d' e' + ace + c'e' + bcde (9 gates)