1. In image compression, k-means can be used as follows: The image is divided into nonoverlapping c×c windows and these c2-dimensional vectors make up the sample. For a given k, which is generally a power of two, we do k-means clustering. The reference vectors and the indices for each window is sent over the communication line. At the receiving end, the image is then reconstructed by reading from the table of reference vectors using the indices. Write the computer program that does this for different values of k and

c. For each case, calculate the reconstruction error and the compression rate.