Just need a table with those missing part ellipsis)

1 322 al 10 E3 E2 MI 60 0 0 0 0 0 0 0 0 0 0 0 0 0 S3 S2 SI S0 C Interpretation (Inputs A and B are invalid.) (Inputs A and B are invalid.) (Inputs A and B are invalid.) (Input A is invalid.) (Input A is invalid.) ( Input A is invalid.) (Input A is invalid.) (Input A is invalid.) (000) 0 0 1 1 0 1 0 0 (0 +1 ) 1 0 1 1 1 9 9 18) 1 0 0 0 . . (Les entres A et B sont invalides.) (Les entres A et B sont invalides.) (Les entres A et B sont invalides.) (Inputs A and B are invalid.) (Inputs A and B are invalid.) (Inputs A and B are invalid.) (Inputs A and B are invalid.) (Inputs A and B are invalid.) Q1: Using a ROM, implement an Excess-3 adder. Consider two numbers represented in Excess-3, this adder will produce the sum (in Excess-3) and the carry. Example: 1010 + 1001 = 0110 with a carry of 1 (7+6=13). ho a) Derive the logic diagram de bloc of the required ROM as well as its inputs and outputs (label them). Note that the inside of the ROM is not to be included. Specify the size of the ROM. ROM 256 X 5 b) Provide the partial truth table of the ROM (first 8 combinations and last 8 combinations + some in between). a3 a2 al a0 b3 b2 b1 bo 0 0 0 0 0 0 0 0 S3 S2 S1 SO Cout X X X X X Interpretation (Inputs A and B are invalid.)