Convert the following Boolean function from a sum$-$of$-$products form to a simplified product$-$of$-$sums form. F$($w$,$ x$,$ y$,$ z$)=(0,1,2,5,8,10,13)2.$ Simplify the following Boolean functions: $($a$)$ F$($A$,$ B$,$ C$,$ D$)=$ $(1,3,5,7,13,15)($b$)$ F$($A$,$ B$,$ C$,$ D$)=$ $(1,3,6,9,11,12,14)3.$ Implement the following Boolean function F$,$ using the two$-$level forms of logic $($a$)$ NAND$-$NAND, $($b$)$ NOR$-$NOR: F$($A$,$ B$,$ C$,$ D$)=(0,4,8,9,10,11,12,14)$