Please show the proving process to this question:

(Maybe AndrewNg SVM note will help)

Recall that the SVM objective can be simplified as minimizing , ile = * -+] aranying 1nr [(a) = ) , -5) ) aa yiyixixi i= 1 l=1 j=1 subject to di 2 0(vi), and 1=1 diyi = 0. Suppose the optimal solution is a* = (Q1*,a2*, ..., Ant). Show that the margin y satisfies 1 v n z di Recall that the SVM objective can be simplified as minimizing , ile = * -+] aranying 1nr [(a) = ) , -5) ) aa yiyixixi i= 1 l=1 j=1 subject to di 2 0(vi), and 1=1 diyi = 0. Suppose the optimal solution is a* = (Q1*,a2*, ..., Ant). Show that the margin y satisfies 1 v n z di