Challenge/tricky! Let A denote a set of logical expressions composed of just 2 base proposi- tions, P. Q. and as many logical operations (eg. ¬, V, ^, etc) as you want. Given that no two logical expressions in A are equivalent, what is the largest |A| could be? Let B denote a set of logical expressions composed of just 3 base propositions, P.Q. R. and as many logical operations (eg. ¬, V, ^ etc) as you want. Given that no two logical expressions in B are equivalent, what is the largest |B| could be?