Suffix Array Practice Problems Compute the suffix arrays of each of the following strings (answers given below). Assume string indices start at 1. SuffixArray(dogwood\$) = SuffixArray(banana\$) = SuffixArray(unabashable\$) = SuffixArray(appellee\$) = SuffixArray(ceaselessness\$) = SuffixArray(nonchronological\$) = SuffixArray(possessionlessness\$) = SuffixArray(nonchronological\$) = SuffixArray(noncorroboration\$) = SuffixArray(teletypesetter\$) = ANSWERS: SuffixArray(dogwood\$) = [8, 7, 1, 3, 6, 2, 5, 4] SuffixArray(banana\$) = [7, 6, 4, 2, 1, 5, 3] SuffixArray(unabashable\$) = [12, 3, 8, 5, 4, 9, 11, 7, 10, 2, 6, 1] SuffixArray(appellee\$) = [9, 1, 8, 7, 4, 6, 5, 3, 2] SuffixArray(ceaselessness\$) = [14, 3, 1, 2, 5, 11, 7, 6, 10, 13, 4, 9, 12, 8] SuffixArray(nonchronological\$) = [17, 15, 14, 4, 12, 5, 13, 16, 10, 3, 8, 1, 11, 9, 2, 7, 6] SuffixArray(possessionlessness\$) = [19, 16, 5, 12, 8, 11, 15, 10, 9, 2, 1, 18, 4, 7, 14, 17, 3, 6, 13] SuffixArray(nonchronological\$) = [17, 15, 14, 4, 12, 5, 13, 16, 10, 3, 8, 1, 11, 9, 2, 7, 6] SuffixArray(noncorroboration\$) = [17, 12, 9, 4, 14, 16, 3, 1, 8, 15, 2, 10, 5, 11, 7, 6, 13] SuffixArray(teletypesetter\$) = [15, 2, 13, 8, 10, 4, 3, 7, 14, 9, 1, 12, 11, 5, 6]