program code for this question: Raju has a lot of strings but he does not like all of them.He likes only Swaggy strings. Now Raju wants to find the Swaggy String S from the given string N. A Swaggy string S has the following properties- It must be lexicographically largest. It must be a subsequence of original string N. Every character in S must appear at least K times.
Select the correct answer from above options