Let's begin implementing the k-Nearest Neighbors algorithm. Define the distance function, which takes in two arguments: an array of numerical features, and a different array of numerical features. The function should return the Euclidean distance between the two arrays. Euclidean distance is often referred to as the straight-line distance formula that you may have learned previously.