I need help in solving the following problem

Problem 1: Consider an implication P = Q. Show that its converse is logically equivalent to its inverse, i.e. not P =1 not Q is logically equivalent to Q = P. Feel free to do this using truth tables or a string of equivalences. If you use equivalences, restrict yourself to the equivalences in the tables below, and state at each step what equivalence you are using. TABLE 6 Logical Equivalences. TABLE 7 Logical Equivalences Equivalence Name Involving Conditional Statements. PATER Identity laws pvFER p-qpV4 PVT=T Domination laws PAFEF abridged from the PYPEP Idempotent laws PAPOP bode version Double negation law pVqoqyp Commutative laws remember : PAGEqAp A = and (pvq)VrEpy (qvr) Associative laws (PAGAREPA(GAr) or Distributive laws - not PA(QVP) =(AGV(PAD) De Morgan's laws PV PADEP Absorption laws PAOVOEP PVTET Negation laws PAYEF