The theorem from question $1.($e$)$ provides an upper bound on the number of steps of the Perceptron algorithm and implies that it indeed converges. In this question, we will show that the result still holds even when is not initialized to