only needed to complete the get_neighbours() function 1 from mat+h import sgrtView site information3 # Function: calculates the distance between two input vectors4 def vec_distance(vector1, vector2):distance = 0.0for cntr in range(len(vector1)-1):distance += (vector1[cntr] - vector2[cntr])**2return sqrt(distance)789.10 # Helper function: returns distance, from position 1 of distance_tuple11 def get_distance( distance_tuple ):12return distance_tuple[1]1314 # Function: sorts list of distances15 def sort_(distances):16distances.sort(key=get_distance)17return distances181920 # Return the required number of nearest neighbours21 def get_neighbours(data, test_vector, num_neighbours):2223#** Your code goes here2425pass # remove this26272829 if -_name_' -_main__':30dataset[2.7810836,2.550537003,0.5],[1.465489372,2.362125076,1.54],[3.396561688,4.400293529,0.72],[1.38807019,1.850220317,1.65],[3.06407232,3.005305973,0.98],[7.627531214,2.759262235,1.2],[5.332441248,2.088626775,1.1],[6.922596716,1.77106367,0.8],[8.675418651,-0.242068655,1.7],[7.673756466,3.508563011,0.76]]3132333435363738394041424344number_of_neighboursindex_of_vectorneighboursif neighbours:for neighbour in neighbours:int(input())+1int(input())get_neighbours(dataset, dataset[index_of_vector], number_of_neighbours)454647print(neighbour) 18.7 LAB: Algorithm ExampleIn this lab you are asked to complete the provided code so that the algorithm calculates "n" nearest neighbours of a given vector. The pointof this exercise it to provide you with an example of an algorithm, get you to think about how to divide a complex task into a number ofsmaller, more manageable steps and to show you an example of how different data types might be used for different purposes.A vector in this context is a point in 3 dimensional space (x,y,z). It could be used to represent a location coordinate e.g. on a google mapwith altitude. You can imagine each vector representing the location of an object and the algorithm is trying to find a number, "n", nearestobjects to the object of interest.Some definitions:• The "n-Nearest Neighbors" of a given vector 'VO' are defined as its 'n' closest vectors ie those with the shortest distance to 'V0'.• The distance between vectors can be calculated using the vec_distance function• Note: the functions vec_distance, and sort_function are provided. You don't need to understand how they work, but you needto understand what their input and output is. To understand that you can print the input and output of them - this can help you figureout what the rest of the code should look like.

Question

only needed to complete the get_neighbours() function 1 from mat+h import sgrtView site information3 # Function: calculates the distance between two input vectors4 def vec_distance(vector1, vector2):distance = 0.0for cntr in range(len(vector1)-1):distance += (vector1[cntr] - vector2[cntr])**2return sqrt(distance)789.10 # Helper function: returns distance, from position 1 of distance_tuple11 def get_distance( distance_tuple ):12return distance_tuple[1]1314 # Function: sorts list of distances15 def sort_(distances):16distances.sort(key=get_distance)17return distances181920 # Return the required number of nearest neighbours21 def get_neighbours(data, test_vector, num_neighbours):2223#** Your code goes here2425pass # remove this26272829 if -_name_' -_main__':30dataset[2.7810836,2.550537003,0.5],[1.465489372,2.362125076,1.54],[3.396561688,4.400293529,0.72],[1.38807019,1.850220317,1.65],[3.06407232,3.005305973,0.98],[7.627531214,2.759262235,1.2],[5.332441248,2.088626775,1.1],[6.922596716,1.77106367,0.8],[8.675418651,-0.242068655,1.7],[7.673756466,3.508563011,0.76]]3132333435363738394041424344number_of_neighboursindex_of_vectorneighboursif neighbours:for neighbour in neighbours:int(input())+1int(input())get_neighbours(dataset, dataset[index_of_vector], number_of_neighbours)454647print(neighbour) 18.7 LAB: Algorithm ExampleIn this lab you are asked to complete the provided code so that the algorithm calculates &#34;n&#34; nearest neighbours of a given vector. The pointof this exercise it to provide you with an example of an algorithm, get you to think about how to divide a complex task into a number ofsmaller, more manageable steps and to show you an example of how different data types might be used for different purposes.A vector in this context is a point in 3 dimensional space (x,y,z). It could be used to represent a location coordinate e.g. on a google mapwith altitude. You can imagine each vector representing the location of an object and the algorithm is trying to find a number, &#34;n&#34;, nearestobjects to the object of interest.Some definitions:• The &#34;n-Nearest Neighbors&#34; of a given vector 'VO' are defined as its 'n' closest vectors ie those with the shortest distance to 'V0'.• The distance between vectors can be calculated using the vec_distance function• Note: the functions vec_distance, and sort_function are provided. You don't need to understand how they work, but you needto understand what their input and output is. To understand that you can print the input and output of them - this can help you figureout what the rest of the code should look like.

Accepted Answer

The neighbours() function is explained as,