Logical conjunction is associative: p ∧ (q ∧ r) ⇔ (p ∧ q) ∧ r. Show that this also applies to the sequential conjunction operator && when translated as in Fig. 6.8, i.e., that p &&(q &&r) generates...

Logical conjunction is associative: p ∧ (q ∧ r) ⇔ (p ∧ q) ∧ r.

Show that this also applies to the sequential conjunction operator && when translated as in Fig. 6.8, i.e., that p &&(q &&r) generates the same code (up to renaming

of labels) as (p &&q)&&r.