Calculate the result of the following Boolean logic functions. ; Assume the order of operational precedence is BRACKETS, ; COMPLEMENT ('), AND (.) , OR (+), and XOR (^). ; (Use chapter 2 lecture slides #45-48) ; ; A+B 9 z ; C+D 10 z ; E+F 11 z ; G+H 12 z ; A+B+C+D+E+F+G+H 13 z ; A.B 14 z ; C.D 15 z ; E.F 16 z ; G.H 17 z ; A.B.C.D.E.F.G.H 18 z ; A'+B+C' 19 z ; D+E'+F 20 z ; G'+H 21 z ; A.H' 22 z ; A+B'.C'+D.E+F'.G'+H 23 z ; A'.B+C'.D+E'.F+G'.H 24 z ; A^B 25 z ; C^D 26 z ; E^F 27 z ; G^H 28 z ; A^B^C^D^E^F^G^H 29 z ; (A^H)' 30 z ; (B'^G)' 31 z ; (C^F')' 32 z ; (D'^E')' 33 z ; A.B+C^D.E+F^G.H 34 z ; A+B^C.D+E^F.G+H 35 z ; A^B.C+D^E.F+G^H 36 z ; T(A',B,C',D) 37 z ; Write the Boolean function for T using "sum of minterms" ; in variable (wxyz) form (it should all be on one line). ; It should be in the form: ; wxyz + ... + w'x'y'z' 38 ; Write the Boolean function for T using "sum of minterms" ; in "mj" form (it should all be on one line). ; It should be in the form: ; m0 + ... + m15 39 ; Write the Boolean function for T using "product of maxterms" ; in variable (wxyz) form (it should all be on one line). ; It should be in the form: ; (w+x+y+z) ... (w'+x'+y'+z') 40 ; Write the Boolean function for T using "product of maxterms" ; in "Mj" form (it should all be on one line). ; It should be in the form: ; M0 . ... . M15 41 ; Would minterms or maxterms be better for implementation? ; Enter "minterm", "maxterm", or "either". 42