1) A Boolean logic function is specified as follows. Fill the truth table and identify the rows with the minterms of this function. How many AND, OR and NOT gates would be needed to realize this function using full SOP form (without minimizing)? F(w,x,y,z) = (2,5,7,10,13,15) w V Z F 2) Build a k-map and realize the minimized SOP form of the above function. How many AND,OR and NOT gates are needed now