Q.Construct the truth table for the statement pattern: $[(p\rightarrow q)\wedge q]\rightarrow p$

Letters standing for unspecified statements (p, q, r, ...) are called statement letters, and any well-formed combination of statement letters with connectives (∧, ∨, →, ↔, ~) is called a statement pattern or proposition; the individual statement letters appearing in it are its prime components. A truth table for a statement pattern with n distinct prime components systematically lists all 2ⁿ possible combinations of T/F for those components (2 components → 4 rows, 3 components → 8 rows) and works out, column by column, the truth value of every intermediate sub-expression until the final column gives the truth value of the wh …