Problem 2 (15 points) ‘A.(S points) For the following circuit, what is the number of equivalence collapsed single — ~ stuck-at faults? Use the simple EFC algorithm that we taught in class, ‘ape ED 0 7s 4. faut tet = 0 ‘anat? 2. foreach gate cr PO oe Plg nN 3 Gero Ha 'S A and ‘snout stom) then faut lit — faut Isto g stckat © and 1 ‘oul end if ise if (output of gat gis fanout stem) thon ‘faust Ug outaut stuck-at O end 1 feu bt ~ faut Ist ginput stuckeat 1 else if gato gs OF) (gate gis NOP) then ‘aulclst ~ faut et U g rut stuck-at 0; 32. enait 38. end foreach 14. return (outst 6 6 7 8. if gate gis AND) | (gate g is NANO) thon 8 10. " Please label the faults in the figure 19, foots, Ofer Efic- 1 , qocks arbie by ches fault, Ifno test exists, please explain. te fr frsr$ ose Vide! ofwos ga Valesd 4H. /yde4 Ee 10 ester + bidrerf + bdf's bed? B, (5 points) Use Boolean Difference to find all test cubs (with X) to detect ¢ stuck-at zero_ and § ache) > arbie? ceed che can dew @ SkO. abst’ ov abef” oy be/Lf ‘sy beef (DAKO) ay (IDO) or O10 140) or (x10x19)