2. [3pt] Consider a knearest neighbors binary classier which assigns the class of a test point to be the class of the majority of the knearest neighbors, according to a Euclidean distance metric. Using the data set shown above to train the classier and choosing k = 5, which is the classication error on the training set? Assume that a point can be its own neighbor. Answer as a decimal with precision 4, egg. (6.051, 0.1230, 1.234e+7) 3. [3pt] In the data set shown above, what is the value of k that minimizes the training error? Note that a point can be its own neighbor