3 (15 points) Support Vector Machine Consider a dataset {(x,y()} where x) = (2,5",2.5T and y {0,1}, which is shown in the figure below. Suppose we have trained a support vector machine (SVM) on the dataset, which has the decision boundary w. x+b = 0, positive plane w x + b = +1 and negative plane w .x+b = -1. The SVM is optimized as following: 1 Find: arg min ||w|l? Subject to: w.x+b> +1, if y = 1 w.x)+b5-1, if y) = 0. w 1) Please draw the decision boundary, positive plane and negative plane in the figure below. 2) Calculate the w and b from your drawn positive plane and negative plane