$($a$)$ A set of Boolean formulas is called consistent if there is an assignment of the

truth$-$values $0$ and $1$ to the propositional variables under which all of the formulas

in the set are true. Is the following set consistent or inconsistent?

f F$1=$ :A $^$ B; F$2=$ B $\_$ :C; F$3=$ :C $!$ Ag