$($a$)$ SVM without a computer. Successfully maximize the margin $M$ for the classes $(-1)$ and $(+1).$

That is find $b$ and $w$ such that we have an equation for $M$ where all conditions are satisfied.

Include all steps. Let the following be your training tuples.

$([0,-1],-1),([-1,0],-1),([0,1],-1),([1,0],-1)$

$([3,-1],+1),([6,-1],+1),([3,1],+1),([6,1],+1)$

$($b$)$ SVM without a computer. Successfully find a hyper$-$plane for the classes $(-1)$ and $(+1).$ where

all conditions are satisfied. Include all steps. Let the following be your training tuples. Hint:

you will need to employ a different component than before to convert the data into a viable state

for an SVM

$([1,-1],-1),([1,1],-1),([-1,1],-1),([-1,-1],-1)$

$([2,-2],+1),([2,2],+1),([-2,2],+1),([-2,-2],+1)$