construct a string of lengthen using the first K letters of an alphabet. The cost to construct the string is the number of instances where pairs of characters match in position and order. for example, to construct a string from the first K$=2$ letters of the English alphabet that is N$=4$ characters long, two of the many possible results are 'abab' for a cost of $1$ and 'abba' for a cost of $0.$ what's the minimum cost with N $=27$ and K $=5?($answer should be either $1$ or $2)$