Now assume that $2(3)=(-1,10).$ How many mistakes does the algorithm make until convergence if cycling starts with data point $(1)$ Also provide the progression of the separating plane as the algorithm cycles in the following list format: $[[0",04)),...,(011),$ OEM$],$ where the superscript denotes different as the separating plane progresses. For example, if $6$ progress from $[0,0($initialization$)$ to $[1,2]$ to $(3,-2),$ you should enter $[[1,2),3,-2)]$ Please enter the number of mistakes of Perceptron algorithm if the algorithm starts with $2(1).2$ Please enter the progression of the separating hyperplane $(0,$ in a list format described above$)$ of Perceptron algorithm if the algorithm starts with u$(1)[(-1,-1).(-2,-1).(-3,9]$ Please enter the number of mistakes of Perceptron algorithm if the algorithm starts with $2(2).1$ Please enter the progression of the separating hyperplane $(0,$ in the list format described above$)$ of Perceptron algorithm if the algorithm starts with r$(2)[(-1,0)$In 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: $(1)=(-1,-1).$ vl$)=1(2)=[1,0].2(3)=(-1,1\mathrm{.}5),$ y$(3)-1$ Given that the algorithm starts with $6(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.