“The task of the 11-​​bit boolean mul­ti­plexer is to decode a 3-​​bit binary address (000, 001, 010, 011, 100, 101, 110, 111) and return the value of the cor­re­spond­ing data reg­is­ter (d0, d1, d2, d3, d4, d5, d6, d7). Thus, the boolean 11-​​multiplexer is a func­tion of 11 argu­ments: three, a0 to a2, deter­mine the address, and eight, d0 to d7, deter­mine the answer. As GEP uses single-​​character chro­mo­somes, T = {a, b, c, 1, 2, 3, 4, 5, 6, 7, 8} which cor­re­spond, respec­tively, to {a0, a1, a2, d0, d1, d2, d3, d4, d5, d6, d7}.”