Task 1A (15 p.) Let the following learning samples be given for the design of a SVM classifier: 1 2 3 4 5 6 'c = ('ci, cz) (1; 1) (1:3) (2:4). (1;-1) (2:1) (3:3) Class 1 1 1 -1 -1 -1 Assume the design of a "SVM classifier under noise", where the penalty constant C = 2; A) Analyse graphically the possible supporting vector sets and select a candidate set that provides the LARGEST margin of SVM. B) With the selected supporting vector set, compute the SVM solution in PRIMARY domain. C) Compute the value of the goal function of the SVM under noise" in this case