Truth Table ABCDY 10 0 1 0 0 0 1 0 2 00101 3 0 0 1 1 1 4 0 1 0 0 0 5 0 1 0 1 1 6 0 1 1 0 1 Given the truth table, where A,B,C,D are Inputs and Y is the output: 7 0 1 1 1 1 8 1 0 0 0 0 9 1 0 0 1 1 10 10 10 1 11 1 0 1 1 1 12 1 1 0 0 1 13 1 1 0 1 0 14 1 1 1 0 0 15 1 1 1 1 0 al Generate the Karnaugh Map b) Draw the largest loops you can use different colored loops preferably. Give the minimal logic expression. (Hint Each loop should correspond to one part of the expression.) Show the parts of the expression that correspond to each loop Attach a file with a b) and Use colored pencis for each loop and show how they correspond to each expression Alternatively, we arrows to show the parts of the expression that correspond to the loops