In a country, there alphabet is a,b,c,d,e. They want automate program that make given list of words to be identical and also efficient. With given N words of length M, find the word that has minimum number of alphabets to change in the list. Input: The first line contains two space-separated positive integers, indicating the N number of words and its length M. After first line, N words will be followed. Output: Print, words that has minimum alphabets to change. If there exists more than one words sequence that has the minimum number of alphabets to change, print the lexicographically smallest. And in next line, Print number of alphabets to change.

Answer rating: 100% (QA)

To solve the problem of finding the word that requires the minimum number of alphabet changes in a g... View the full answer