The minimum number of $2-$input NAND gates required to implement the Boolean function $\}F=(x+y)(z+w)$ is:

Select one:

a$.4$

b$.3$

c$.5$

d$.$ None

e$.6$