(b) (i) A database containing 1Million color images (each image of size=64-by-64). Explain the steps to create a color look-uptable (LUT) using the the K-means clustering algorithm with K=128. (show the size of the data array before and after the Kmeans algorithm). (ii) Explain the steps to produce an indexed-color histogram Feature-Vector of length 128 for each image in the given database using the LUT in (i). (c) Discuss why the indexed-color histogram can better represent the color information in an image than the RGB color histogram