1 votes 1 votes Detailed Solution please..! Digital Logic digital-logic + – Anmol_Binani asked Jan 5, 2018 Anmol_Binani 420 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Anu007 commented Jan 5, 2018 reply Follow Share getting 4. 1 votes 1 votes Anmol_Binani commented Jan 5, 2018 reply Follow Share yes answer is 4.. solution please 0 votes 0 votes hacker16 commented Jan 5, 2018 reply Follow Share 4 is the correct option. after simplifying f = A.B.C which can be implemented using NAND Gate as = ((((A.B)')'.C)')' which required 4 NAND Gate. 0 votes 0 votes Anmol_Binani commented Jan 5, 2018 reply Follow Share how did you simplified the given term.. please explain.. i am not able to get it.. ! 0 votes 0 votes LeenSharma commented Jan 5, 2018 reply Follow Share $A \overline{(\overline B + A \overline C )}\\ \equiv A(\overline{(\overline B )} \ \overline{( A \overline C )}) \\ \equiv A B (\overline A + C )) \\ \equiv (A B \overline A +ABC ) \\ \equiv (ABC)\\ \equiv \overline{\overline{(\overline{\overline{(AB)}}C )}}$ 2 votes 2 votes Anmol_Binani commented Jan 5, 2018 reply Follow Share thank you 0 votes 0 votes Please log in or register to add a comment.