Create a function named Letters which receives the same dna string used in the previous problem. This function will create a list. This list will contain tuples. Each tuple has two items. One is a letter that is in the dna string, and the second is the number of times that this letter appears in the string. There should be only one tuple per letter. The tuples should be sorted before the function returns the list.