Let 'X' be the ternary connective such that 'Xpqr' is logically equivalent to '(p --> q) (q --> r)'. We have: p --> q = = ] -p 1 q. 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: -pl = = | X