Explain what this code does in plain English. Then identify any bugs or design issues. ```python def f(x, n=3, m=None): m = m or {} if n == 0: return [[]] if x in m: return m[x] r = [] for i in range(len(x)): for p in f(x[:i] + x[i+1:], n-1, m): r.append([x[i]] + p) m[x] = r return r def g(s, k): from collections import Counter c = Counter(s) h = [] import heapq for ch, cnt in c.items(): heapq.heappush(h, (-cnt, ch)) r = [] while h and len(r) < k: cnt, ch = heapq.heappop(h) r.append(ch) return ''.join(r) ```