You are to find an optimal vector of weights for the SVM linear classifier that perfectly classifies the given set of objects. The object descriptions (vectors of numbers) are provided in an array x, in which every row corresponds to an object, and columns correspond to vector components. The classes (-1 and +1) for each of the objects are provided in a separate array y. You are to output space-separated sequence of the weights a ... 0mb such that function /(:1,...,m) = sign(am +...+ amin + b) perfectly classifies the provided objects. Sample Input: x = [ [0.1, 0.5, 3.0], (1.0, -1.0, 0.0], (0.0, 1.0, 0.0], [0.1, 0.5, 1.0) y = (1, 1, -1, 1] Sample Output: 3.0 -1.0 1.0 0.0 Write a program, test using stdin stdout Time limit: 15 seconds Memory limit: 256 MB You are to find an optimal vector of weights for the SVM linear classifier that perfectly classifies the given set of objects. The object descriptions (vectors of numbers) are provided in an array x, in which every row corresponds to an object, and columns correspond to vector components. The classes (-1 and +1) for each of the objects are provided in a separate array y. You are to output space-separated sequence of the weights a ... 0mb such that function /(:1,...,m) = sign(am +...+ amin + b) perfectly classifies the provided objects. Sample Input: x = [ [0.1, 0.5, 3.0], (1.0, -1.0, 0.0], (0.0, 1.0, 0.0], [0.1, 0.5, 1.0) y = (1, 1, -1, 1] Sample Output: 3.0 -1.0 1.0 0.0 Write a program, test using stdin stdout Time limit: 15 seconds Memory limit: 256 MB