2. (b) Consider the following final equation to prove the convergence of the perceptron algorithm. Where the signs express conventional meaning. Now if we keep the value of pk constant and the value is greater than 1, will the algorithm converge in a finite iteration? Explain your answer. The final equation is, ||w(t+1) aw*|| = ||w(0) aw*|| +32 (P - PR k=0 k=0 2. (b) Consider the following final equation to prove the convergence of the perceptron algorithm. Where the signs express conventional meaning. Now if we keep the value of pk constant and the value is greater than 1, will the algorithm converge in a finite iteration? Explain your answer. The final equation is, ||w(t+1) aw*|| = ||w(0) aw*|| +32 (P - PR k=0 k=0