Which of the following is true of the value of k in the k-Nearest Neighbors algorithm? A) The value of k is always taken as a constant and is equal to 1. If the value of k is large, it drastically increases variability. If the value of k is very large, it introduces biases into the classification decisions. If the value of k is large, the classification of a record is very sensitive to the classification of the single record to which it is closest.