The binary connectives in propositional logic are $,,$ and $->.$ Show that all propositional logical formulas have more propositional variables than binary connectives $($multiple occurrences of the same variable or the same connective count multiple times; for example, $(($P $$ Q$)$ R$)$ has three propositional variables and two binary connectives$).$