Arrange the following steps in a k -nearest neighbors analysis of a classification problem in the most appropriate order (assume k is fixed):

Arrange the following steps in a k-nearest neighbors analysis of a classification problem in the most appropriate order (assume k is fixed):

a) For each point to be classified, find the k closest training observations and classify using the most common class.

[ Choose ]

1

3

2

b) For each point to be classified, calculate the distance from each training observation using an appropriate distance metric.

[ Choose ]

1

3

2

c) Standardize the predictor/feature variables if appropriate to do so.