You are given 6 training examples for a binary classification problem as follows:

10 0+ 0 -10 5 -2 5 10 Plot these points in a 2-dimensional grid and show the decision boundary resulting from 1- NEAREST NEiGHBoR. Hint: To get started, connect each point with the closest point from the opposite class. Then, for each of the 5 line segments that you drew in this way, draw the perpendicular bisector. The decision boundary consists of certain line segments of these bisectors. After doing this exercise, you will certainly appreciate the complexity of target functions that can be learned with nearest neighbor