need python code asap

Implementation of Gaussian Naive Bayes or k-Nearest Neighbors for Digit Recognition (Total: 5 pts, Bonus: 2 pts) In this exercise, you are to implement only one of two possible classifiers (your choice). Note, you are not to use modules which provide these functions - that would be too easy (no sklearn.naive_bayes, for example) but rather create them yourselves. Students who implement the logic for writing code for both the classifiers will be given bonus credit. The performance of your classifier implementation will be evaluated for the classifier functionality (whether you correctly implement kNN or Nave Bayes for the dataset) rather than efficiency. The data set to use is the digit recognition data set available from the sklearn module; the demonstration linked here should provide some guidance. You are expected to use Jupyter notebooks and Python on this assignment, but can ask for exceptions. Your goal is to take the first half of the data set to train your model, and the last half is used for prediction. a) k-Nearest Neighbors Each digit is an 8x8 pixel patch, which when reshaped is a 64 length vector. Distance metric: the simplest distance metric for k-Nearest Neighbors is the sum of squares error between pixel values. For each example in the test set, calculate the distance to every other example in the training set. Identify the closest k neighbors (a good use of numpy.argsort). Pick the class which most of the neighbors belong to. Break ties in any way you wish. Compare the true class of each member of the test set to the predicted class using k-Nearest neighbors. Report the accuracy. 1. Now, change the value of k. Create a table with the accuracy for k=1, k=3, k=5, and k=100, and k=500 2. Show a classification matrix for each run of k. You can use sklearn.metrics.confusion_matrix for this 3. Note which errors are more common. In what way does that match your intuitions?