1) For the following given function, F, find the minterm (SOP) and Maxterm (POS) expansions in both Algebraic and canonical forms, for both F and its complement. F(A,B,C) = M (1,3,6,7) F (SOP) = F (POS)- F (SOP)- F (POS) 2) Implement the following function using a NOT-AND-OR network and then convert the network to all NAND network. (Please, use straight lines for connections. Use shaded areas to neatly outline your gates) F ACD+ACD BD+C 3) Dave can take an extended Vacation (V) if he completes the Project (P) early and has no Other (O) projects. He can also take extended vacation if his boss does not Mind (M) him finishing Half (H) of the project and getting Commitment (C) from Mary to finish it. Write a Boolean expression for V as a function of the six variable, P, O, M, H, and C