Discuss complexity of calculation of the boolean difference

Question

Discuss complexity of calculation of the Boolean difference of a function of n variables by FFT-like algorithms and through decision diagrams. Illustrate the considerations by the example of functions f₁ and f₂ defined by the truth-vectors

and determine the number of EXOR operations required in FFT-like algorithms and decision diagram methods.