from Chapter 5 of Welling’s book. Write a short research report (2-4 pages) that describes the k-Nearest Neighbours (kNN) algorithm and its variants. Your report must show a complete kNN algorithm as well as a detailed, worked example with all the steps and calculations. Use the following data set in your worked example: Positive instances: P1 = (5, 5, P) P2 = (6, 4,P) P3 = (3,4,P) P4 = (2,4,P) Negative instances: N1 = (1, 2,N) N2 = (2, 0,N) N3 = (6, 7,N) N4 = (8,8,N) A new data point of unknown class is at Q1 =