Q.What is canonical SOP equation?

Every Boolean function can be written in a standard, fully expanded form built from minterms and maxterms.

A minterm is a product (AND) term that contains every input variable exactly once, either in true or complemented form. Each minterm equals 1 for exactly one combination of the inputs, so minterms correspond to the rows of a truth table where the output is 1. A maxterm is a sum (OR) term that likewise contains every variable once; each maxterm equals 0 for exactly one input combination, corresponding to the rows where the output is 0. …