Problem 2: Given the code, design a state graph for decoding in a minimum number of cycles. Show look-up tables for the FSM decoder. Consider partitioning the table to two decoding tables. Symbol Codeword a 1100 b 11010 c 00 d 100 e 110110 f 110111 g 01 h 101 How many machine cycles would the decoding of the following sequence take with the designed state machine? 000000110111110110010101 Construct the canonical code from the lengths of codewords.