1. [21 marks] Digital Logic. Let X be the ternary connective such that 'par' is logically equivalent to (p --> ) A(9 -->). We have: p --> 91==1 -p Vq. Here, 'F' and 'T' denote the 0-place connectives 'false' and true, respectively. There are some constraints. In a), show a solution with one 'F'. In b), show a solution with the letters in alphabetical order. In c), show a solution with one 'p' and the letters in alphabetical order (ignore negation) a) Using {'X', 'F), synthesize: -p1==1 X- --- b) Using {'X', 'T'}, synthesize: p/q == X c) Using {X",-), synthesize: pVqi==IX__ 1. [21 marks] Digital Logic. Let X be the ternary connective such that 'par' is logically equivalent to (p --> ) A(9 -->). We have: p --> 91==1 -p Vq. Here, 'F' and 'T' denote the 0-place connectives 'false' and true, respectively. There are some constraints. In a), show a solution with one 'F'. In b), show a solution with the letters in alphabetical order. In c), show a solution with one 'p' and the letters in alphabetical order (ignore negation) a) Using {'X', 'F), synthesize: -p1==1 X- --- b) Using {'X', 'T'}, synthesize: p/q == X c) Using {X",-), synthesize: pVqi==IX__