Consider a k-nearest neighbor classifier using Euclidean distance metric on a binary classification task. We assign the class of the test point to be the class of the majority of the k nearest neighbors. Note that a point can be its own neighbor. Suppose k=3.

Coordinate of new point is (A, B). Predict the category of the new point according to K-NN algorithm. Clearly mention all steps and calculations.

Where,

A= 2

B= 3

10 9 8 1 7 + 6 ch 5 4 + 3 2 1 1 + 0 1 N 3 4 5 6 6 7 8 9 10