3. Six words are given: ZANOZA, ZIPUNY, KAZINO, KEFAL', OTMEL', SHELEST. In one step, you can replace any letter in any of these words with any other letter (for example, in one step, you can get the word ZKNOZA from ZANOZA). How many steps are needed to make all the words the same (nonsense words are allowed)? Provide an example and prove that it is impossible to do so with fewer steps.


3. Let's write the words in a column:

| ![](https://cdn.mathpix.com/cropped/2024_05_21_6455f48598646f41a890g-279.jpg?height=189&width=229&top_left_y=1419&top_left_x=574) |  |  |  |
| :---: | :---: | :---: | :---: |

After all the letter replacements in each column, the letters should become the same. The number of replacements will be the smallest if, in each column, the most frequent letter (any of them if there are several) is retained. For example, in the first column, we can keep the letters 3 or К. In both cases, to make the first letters the same, four replacements will be required. In the second column, four replacements will also be needed. However, in the third column, all the letters are different, so five replacements will be required. In the last three columns, four replacements will be needed each. The minimum number of replacements in all columns is \(4+4+5+4+4+4=25\).

Comment. Among the words that can result, there are meaningful ones, such as ЗЕЛЕНЬ (GREEN), КАПЕЛЬ (DROPLETS), or КАФЕЛЬ (TILE).