Smallest Palindromic Rearrangement I

Given a palindromic lowercase string s, return the lexicographically smallest palindromic permutation of its letters. This reduces to counting character frequencies and greedily constructing the smallest possible first half (with a middle char if any odd count) and mirroring it.