Write a method called which accepts two Maps as parameters. The first map links a number value (integer) to a count of the times that number occurs (integer) in a paint by number image. The second map links each paint by number value (integer) to the associated color for that number (string). Your method should return a map of the colors (strings) linked to their counts (integers) in the picture. Additionally, your method should print which color has the most spots to color in the image. For example, if your method was passed: numbers={4=21,1=10,3=51,2=90,5=60}colors={4=Back,1=Red5=Green,3=Purple,2=Yellow} Then your method would return {Red=10,Green=60,Black=21,Yellow=90,Purple=51} Note that the ordering of the colors "does not" matter. Your method would also print If more than one color has the highest count, this statement would print for every color with the max count of spaces. You are not allowed to construct any auxiliary data structures to solve the problem (no list, array, string, new sets or maps, etc) except the one new map that needs to be returned. Your method is expected to have reasonable efficiency in that it shouldn't lead to more operations than necessary. Example of a Paint By Number Picture