0 votes 0 votes Consider the Boolean function f(A, B, C, D) = ∏(0, 1, 2, 4, 5, 6, 8, 10). Determine the minimum number of NOR gates required to implement the function f. Assume both primed and unprimed variables are available. Sambit Kumar asked Aug 31, 2017 Sambit Kumar 312 views answer comment Share Follow See 1 comment See all 1 1 comment reply smsubham commented Jan 29, 2020 reply Follow Share Ans 4 0 votes 0 votes Please log in or register to add a comment.