# Boolean algebra - Maxterms

I have a boolean expression and I need to get to the canonical forms of it (sum of minterms and product of maxterms).

In order to get an expression for the first canonical form, I need to multiply every term by (x + ~x), where x is the missing variable. Is there a similar algorithm to get to the second canonical form?