searching and sorting colormap is lookup table or color palette containing limited set of colors early color graphics cards could only display up to unique colors at one time colormaps were used to specify which colors should be used to display color images on such device software applications were responsible for mapping each color in the image that was to be displayed to color in the limited color set specified by the colormap we can define colormap adt for storing limited set of colors and for use in mapping one of the million colors possible in the discrete rgb color space to color in the colormap given the description below of various operationsimplement the colormap adt using - array structure colormapk )creates new empty colormap that is capable of storing up to colors length ()returns the number of colors currently stored in the colormap contains color )determines if the given color is contained in the colormap addcolor )adds the given color to the colormap only one instance of each color can be added to the colormap in additiona color cannot be added to full colormap remove color )removes the given color from the colormap the color must be contained in the colormap in order to be removed mapcolor )maps the given color to an entry in the colormap and returns that color common approach is to map the color to its nearest neighbor in the colormap the nearest neighbor of color is the entry in the colormap that has the minimum euclidean distance squared between the two colors if there is more than one nearest neighbor in the colormaponly one is returned in additionthe colormap must contain at least one color in order to perform the mapping operation iterator ()creates and returns an iterator object that can be used to iterate over the colors in the colormap evaluate the map(method of your implementation of the colormap adt from the previous question to determine the worst case time-complexity colormaps are used in color quantizationwhich is the process of reducing the number of colors in an image while trying to maintain the original appearance as much as possible part of the process recolors an original image using reduced set of colors specified in colormap (aimplement the function recolorimageimagecolormap )which produces new colorimage that results from mapping the color of each pixel in the given image to its nearest neighbor in the given colormap (bwhat is the worst case time-complexity for your implementation