Show that ∼ can be simulated using only → and False. That is, design a logical expression that uses only → and False and that, given a single proposition p, is logically equivalent to ∼p. You must prove that your logical expression is correct using equivalence rules.