Consider a language of propositional logic $($lberformula using only.a$.$ Atomic Propositionsb. The atomic value FALSEc. The ternary operator M is defined as follows:$\backslash$Mu $(\backslash$Phi $1,$ phi$\_\{2\},\backslash$Phi $3)$ is TRUE it and only if the majority Cie two or more$)$ of $$,$ phi$\_\{2\}$ and phi$\_\{3\}$ evaluate to FALSE.Argue that this set of features is adequate i$.$e$,$ all propositional formulas can be rewritten using theseii$)$ How many rows would our truth table have if we wish to use truth table to check for the satisfactory satisfiability of the following:$($p vee q vee neg$^$ r $)^($ neg P vee q vee s$)^($ rvv s vee neg t v $7$q$)$