[5 points] suppose we run the perceptron algorithm with w initialized to be an arbitrary unit vector. suppose that the algorithm is then given the same vector x (whose label is 1) over and over again. how many mistakes can it make in the worst case?
express your answer in terms of ||x||2. (hint: derive the result from first principles, do not attempt to use the general result we proved in class).