An ABCD-to-seven-segment decoder is a combinational circuit that converts a decimal digit in BCD to an appropriate code for the selection of segments in an indicator used to display the decimal digit in a familiar form. The seven outputs of the decoder (a, b, c, d, e, f, g) select the corresponding segments in the display, as shown in Fig (a). The numeric display chosen to represent the decimal digit is shown in Fig (b). Using a truth table and Karnaugh maps, design the BCD-to-seven-segment decoder using a minimum number of gates. _The six invalid combinations should result in a blank display._**Figures:**- **(a) Segment designation:** Diagram showing segments labeled a through g, organized in the arrangement typical of a digital display.- **(b) Numerical designation for display:** Illustration of numbers 0 through 9 using combinations of the seven segments.**Questions:**1. Using the truth table, find the sum-of-minterms for the function for _each_ segment.2. Using a Karnaugh map, obtain a minimum sum-of-products form for _each_ segment.

A Display Decoder is a combinational circuit that decodes n-bit input value into a number of output lines to drive a display.A Digital Decoder IC, is a device that converts one digital format into another. Ex: Binary Coded Decimal (BCD) to 7-Segment Display Decoder.In Binary Coded Decimal (BCD), each of the decimal numbers( 0-9) is represented by its equivalent binary pattern( which is generally of 4-bits).Whereas, Seven segment display is an electronic device which consists of seven Light Emitting Diodes (LEDs) arranged in a definite pattern (common cathode or common anode type), which is used to display Hexadecimal numerals.The input to the 7-segment display is number to be displayed, largest number to be displayed on a single 7-segment display is 9, which can be represented in 4 bits. Hence, input is 4 bit number (ABCD) to be displayed and output is 7-bit number which are 7 segments (a to g).Truth table:ABCDabcdefg00001111110000101100000010110110100111111001010001100110101101101101101011111011111100001000111111110011111011Kmap and simplified expression for a,b,c,dKmap and simplified expression for e,f,gThe simplified expression from the kmap is given asa = A’C + A’BD + B’C’D’ + AB’C’b = A’B’ + A’C’D’ + A’CD + AB’C’c = A’B + A’D + B’C’D’ + AB’C’d = A’CD’ + A’B’C + B’C’D’ + AB’C’ + A’BC’D e = A’CD’ + B’C’D’f = A’BC’ + A’C’D’ + A’BD + AB’C’g = A’CD’ + A’B’C + A’BC’ + AB’C’