Given a string text containing only lowercase English letters and a positive integer k, find the substring of length k that appears most frequently in text. Overlapping occurrences count separately.

If more than one substring ties for the highest frequency, return the one that comes first in lexicographic order. If no valid substring of length k exists (i.e., k > text.length), return an empty string. ...