Use strong mathematical induction on the complexity of formula φ to show that the number of occurrences of the symbol ∧ in φ is less than or equal to the number of left brackets in φ.