Construct a string of length Nusing the first K letters of an alphabet. The cost to construct the string is the niumber of instances wthere airs of thar acta match in position and order. For example, to construct a string from the first k $2$ letters of the English alphabet that is y I char acters long, taw of tre many possible results are 'abab' for a cost of $1$ and 'abba' for a cost of $0.$ Construct the strings for the following test cases to minimize cost. Select the list of answers that matches the costs Test Case $1$: N$=9$ K$=4$ Test Case $2$: N$-27$ K$=5$ Test Case $3$: N$-33$ K$=4$