Look at the following program line, an example when the program is run above. If |A| = 4 and |B| = 4 with members of the set A = {0,1,2,3} and B = {0,1,2,3} in decimal base, then: a. Find the members of sets A and B in binary base; b. Make a truth table equipped with a don't care condition (if any) to complete the program instructions in rows number 11 to 14 with the conditions for entering the values A and B specified in point (a). c. Make a Karnaugh map from point (b) while still using don't care (if any). d. Make a Boolean Algebraic equation from points (b) or (c). e. Draw a (simplified) logic circuit that produces an output of 1 if or 0 if not, according to the programs in Figure 1 and Figure 2. f. Redraw the logic circuit from point (e) if only NAND gates are allowed (hint: use De Morgan's law).