C) Constraint satisfaction is the ans
in this cryptoarithmetic problem there are some constraints like 1) no two alphabets can have same number
2)every number can have values in the range 0-9
by considering these constraints we will solve the above problem which satsify these constraints like M will be 1 as it is carry and so on