Problem 3 (20 points) Using RD flip-flops as defined below, design a system as described below. Use only multiplexers to implement your combinational logic. Input set: {a,b,c} Output: 1, if x(tn,t)=a[bc]d+a 0 , otherwise Note: denotes a character can appear 0 to infinite number of times. + denotes a character can appear 1 to infinite number of times. b c denotes b or c. For example, given abcbdda, the output should be 1