It turns out that it is easy to evaluate Boolean formulas directly in linear time. The spirit of this problem is to avoid doing so! A connective in a Boolean formula is an AND, OR, or NOT.

(a) For concreteness, assume that you are only allowed to use the program that evaluates Boolean circuits; everything else has to be done by hand. In one or two sentences, explain how you would use the Boolean circuit evaluation program to evaluate Boolean formulas.
(b) Show what you would do on the following example (from above): ((A ∧ B) ∨ (A ∧ C)) ∧ (B ∧ C)
(c) Assume that your roommate is very bright, and knows about Boolean formulas and circuits. You have a formula with a large number of connectives that you would like to evaluate. You still have the program that evaluates Boolean circuits; as before, everything else has to be done by hand. You are too lazy (or busy) to evaluate the formula yourself, but your roommate is willing to do it for you. In a few sentences, state what you would tell your roommate to do. (NOTE: A Boolean formula is actually two smaller Boolean formulas separated by an AND or OR, or the NOT of a smaller Boolean formula.)
(d) How fast is this, as a function of n, the number of connectives? Justify. (Don’t overthink this! The simple, obvious answer is all you need.)