(3pts) The simplest Boolean function is a function of a single bit. The are four such unique functions: f 1 (x)=0,f 2 (x)=x,f 3 (x)=¬x,f 4 (x)=1. For each of the four functions, show that Deutsch's algorithm given by the circuit where the oracle f does the transformation ∣x⟩→(−1) f(x)∣x⟩ can distinguish whether the function is constant or balanced.