plz solve for 2(c,d) ; 3(b,c), and 4

Problem 2 These are questions about the SVM. (a) Jeasy State the hypothesis set H inputted into the support vector machine algorithm. Is it different than the H used for 4 perceptron learning algorithm? (b) (difficult]MAProve the SVM converges. State all assumptions. Write it on a separate page. (c) (difficult Let y = {-1, 1). Rederive the cost function whose minimization yields the SVM line in the linearly separable case. The re at the the NN with Problem What does look in the model with p-It Wh A - KNN, deribe the best the w w Cosider the left that the poin t ay u Use then OL sih. Prove we derived in c . handel C het OLS. Prove that the write , Problem 2 These are questions about the SVM. (a) Jeasy State the hypothesis set H inputted into the support vector machine algorithm. Is it different than the H used for 4 perceptron learning algorithm? (b) (difficult]MAProve the SVM converges. State all assumptions. Write it on a separate page. (c) (difficult Let y = {-1, 1). Rederive the cost function whose minimization yields the SVM line in the linearly separable case. The re at the the NN with Problem What does look in the model with p-It Wh A - KNN, deribe the best the w w Cosider the left that the poin t ay u Use then OL sih. Prove we derived in c . handel C het OLS. Prove that the write