When cataloguing a collection of genetic strings, we should have an established system by which to organize them. The standard method is to organize strings as they would appear in a dictionary, so that "APPLE" precedes "APRON", which in turn comes before "ARMOR".
Assume that an alphabet
Given two strings
Given: A collection of at most 10 symbols defining an ordered alphabet, and a positive integer
Return: All strings of length
T A G C 2
AA AC AG AT CA CC CG CT GA GC GG GT TA TC TG TT
As illustrated in the sample, the alphabet order in this problem is defined by the order in which symbols are provided in the dataset, which is not necessarily the traditional order of the English alphabet.