Given a string s, can you compose exactly K non-empty palindromes using all leters of s?\n\nNote that you can use only letters from s. Each letter from s that you use has to appear exactly the same number of times in your palindromes as it does in s. Also note that you can rearrange string letters as you want.\n\nExample:\n```s = \'abracadabra\'``` and ```k = 3``` output of ```composeKPalindrome(s, k) = true```\n\nThe answer is ```true``` since you are able to compose ```3``` palindromes using each letter of ```\'abracadabra\'``` once. ```3``` possible palindromes that fulfill this requirement for example can be: ```\'raaaaar\'```, ```\'bcb\'``` and ```\'d\'```.\n\nFor ```s = \'abracadabra\'``` and ```k = 2```, the output should be ```composeKPalindrome(s, k) = false```\n\nAny idea how to solve it?

Given a string s, can you compose exactly K non-empty palindromes using all leters of s?\n\nNote that you can use only letters from s. Each letter from s that y