Consider running the Perceptron algorithm in the online model on some sequence of examples S$.$ Let S$\text{'}$ be the same set of examples 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$\text{'}?$ If so$,$ why? If not, show such an S and S$\text{'}($consisting of the same set of examples in a different order$)$ where the Perceptron algorithm makes a different number of mistakes on S$\text{'}$ than it does on S$.$

Please give correct example.