n this problem, we will investigate the perceptron algorithm with different iteration ordering.

Consider applying the perceptron algorithm through the origin based on a small training set containing three points:

x(1) =[-1,-1],	y(1)=1
x(2) =[1,0],	y(2)=-1
x(3) =[-1, 10],	y(3)=1

Given that the algorithm starts with (0)=0, the first point that the algorithm sees is always considered a mistake. The algorithm starts with some data point and then cycles through the data (in order) until it makes no further mistakes.

How many mistakes does the algorithm make until convergence if cycling starts with data point x(1)?

Also provide the progression of the separating plane as the algorithm cycles in the following list format: [[(1)1,(1)2],,[(N)1,(N)2]], where the superscript denotes different as the separating plane progresses. For example, if progress from [0,0] (initialization) to [1,2] to [3,2], you should enter [[1,2],[3,2]]