A k-mer P is defined as a palindrome if its reverse complement is identical to itself, e.g., ATCCGGAT. Many DNA-binding proteins are dimers, formed by two identical protein domains in opposite directions. As a result, the DNA sequences recognized by these proteins are palindromes. Devise an algorithm(psuedo-code) to output all palindromes of a given length k (e.g., k=8 in the above example) in an input DNA sequence Text. What is the running time of your algorithm in term of Big-O notation?