Exercise 5.3 (Perceptron; Section 5.8.3) Consider running the Perceptron algorithm in the online model on some sequence of eramples S. Let S' be the same set of ezamples as S but presented in a different order. Does the Perceptron algorithm necessarily make the same number of mistakes on S as it does on S? If so, why? If not, show such an S and S (consisting of the same set of eramples in a different order) where the Perceptron algorithm makes a different number of mistakes on S' than it does on S