Given a sequence S = 'CGATCGATCG', and another sequence Q= 'TATCTCATG', find a reasonable alignment using the FASTA algorithm. a. Builds an index table to store the positions of all 2-letter words' (doublets) occurrences in S, b. Constructs a second table that compares the doublet positions in Q with S and stores the distances, c. Offsets the Q by the number that appears as a distance maximum number of times in indextable #2 and prints the reasonable alignment without gaps. Example: S=AGAAGAQ=TGAAG Index tableH1: Index table\#2: Reosonable alignment: AGAAGA II TGAAG