Show that the greedy tactic of assembling the product array from the pairwise products of the multiplicand arrays first multiplies B times D, then A times C, and finally the product BD times the product AC. Demonstrate that the alternative of multiplying A times B, then C times D, and finally the product AB times the product CD requires fewer total multiplications [18]. 5.

Verify the numerical entries in Table 7.3.