Consider the following four types of gates: AND, OR, NAND and NOR. If we assign one type of gate for the first level and one type for the second level, we find that there are 16 possible combinations of two-level forms. Eight of these combinations are said to be degenerate forms because they result in a single Boolean operation. List these eight degenerate combinations and show why this is the case, resulting in extending the number of inputs to a gate. Include a labeled (inputs and outputs at each stage) circuit diagram for each case. (Non-degenerate forms are listed at the bottom of pg. 98 of the textbook.) (Use Logisim Export Image for all circuit diagrams)