Your manager calls you into the office with the following comment: We are now moving into the business of Boolean formula satisfiability. Starting next month, every morning we will be receiving a large number of large Boolean formulas. For each formula, we will need to determine if it is satisfiable. Note that we do not have to actually find the satisfying assignment; we just need a YESor wires in the Boolean circuit. How fast can you determine if a formula with n connectives is satisfiable? Justify.

c. Assume that the Boolean circuit satisfiability program works in time (m”), where m is the number of gates and****************/