We will develop an SVM Kernel Trick 1 for Linear SVM for weighted dataset: Each data point in the dataset has a weight associated: {xn, yn, Un} Where un is the weight associated with the nth data point Now we will derive the Linear SVM with these weights in it. You are allowed to keep a copy of the derivation of the Kernel Trick 1. Prove that the Dual SVM for this dataset is: LD = ; u;;uiai - i UY . Xj Show the following steps: (a) All the constraints (Hint: Individual constraints won't change) (b) Objective function (Hint: The original objective function also does not change) (c) Primal LP (Hint: The constraints will have additional weights from ui terms in it) (d) Do the derivatives w.r.t. w and b wwwww (e) Substitute the values and simplify