In these cases, we might try to correct for noise while training the classifier. Consider the following formulation for training a logistic regression classifier w ∈ R d on a noisy training data set (x (1), y(1)), . . . ,(x (n) , y(n) ), where for each i, y (i) ∈ {−1, +1}. For simplicity, we ignore the bias term b. Suppose we know that the noise magnitude is at most r. Then, instead of the standard logistic regression loss, we might want to minimize the following loss: L˜(w) = Pn i=1 L˜ i(w), where, L˜ i(w) = max z (i):kz (i)−x(i)k≤r log(1 + exp(−y (i)w >z (i) )), where kvk means the L2-norm of vector v. (a) (5 points) Prove that for all i, L˜ i(w) = Mi(w), where Mi(w) = log(1 + exp(rkwk − y (i)w >x (i) )). For full credit, show all the steps in your proof.