You are given a genome as a string S of length n over the alphabet = { a, c, g, t }; and aninteger k between the values of 1 and 37.

You are given a genome as a string S of length n over the alphabet = { a, c, g, t }; and aninteger k between the values of 1 and 37.Your system is to compute the set of k-mers p over the alphabet = { a, c, g, t } that occurin the genome S, together with a count of the number of occurrences of p, and a list ofpositions i of p in S.