3853. Merge Close Characters

You are given a string s consisting of lowercase English letters and an integer k. Two equal characters in the current string s are considered close if the distance between their indices is at most k. When two characters are close, the right one merges into the left. Merges happen one at a time, and after each merge, the string updates until no more merges are possible. Return the resulting str