D$.$ Apply the Uniform Cost Search algorithm to the graph given below. Show

all intermediate steps indicating how the search proceeds towards the goal.

Is this a greedy algorithm? Justify your answer.

$20+5=$

$25$

QUESTION $4(100$ Marks$)$

A$.$ What are Support Vector Machines $($SVM$)?$ Within the SVM$,$ how is the

optimal decision boundary selected? Explain the significance of the $$kernel

trick$$ used within SVMs$.$

$10+5+$

$10$

$=25$

$25$

$3$

S

$5$ A D

C

B

$2$

E

G