Rule:

To determine the canonical form we should OR the min terms. A min term is defined as a Boolean equation of the input if the output is logic '1'. If the input is logic '1' we use the letter, if logic '0' we use the NOT of the letter.

Unless you are asked to there be no need to draw the circuit 

Note:

  The circuit is not the same as the circuit we started off with, but is larger. There are techniques of reducing the canonical form down to smaller, minimal form, using Boolean algebra or karnaugh maps.