Answer Happy

How many mistakes does the algorithm make until convergence if the algorithm starts with data point (¹)? How many mistakes does the algorithm make if it starts with data point (²) ? Also provide the progression of the separating plane as the algorithm cycles in the following list format: [[0(¹), ,..., [0,0]], 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]] Please enter the number of mistakes of Perceptron algorithm if the algorithm starts with x(¹). Please enter the progression of the separating hyperplane (0, in the list format described above) of Perceptron algorithm if the algorithm starts with (¹) (0) Please enter the number of mistakes of Perceptron algorithm if the algorithm starts with a (2). Please enter the progression of the separating hyperplane (0, in the list format described above) of Perceptron algorithm if the algorithm starts with (2)