Suppose Enc is a deterministic algorithm. Write the code of a distinguisher/attack that will break the CPA security of Enc. You dont have to show the output probabilities. For reference, here is the CPA security definition. \begin{tabular}{l} \multicolumn{1}{c}{LcpaL} \\ k. KeyGen \\ c:=Enc(k,mL)EAVESDROP(mL,mR.M): \\ return c \end{tabular}