Distribution Counting Algorithm & Boyer-Moore Algorithm

PLEASE GIVE PSUEDO CODE. DO NOT WRITE ACTUAL CODE. I NEED PSUEDO CODE EXPLANATION WRITTEN

1. (5 points) Assuming that the set of possible list values is (a, b, c, dy, sort d, c, a, c, c, a, b, b in alphabetical order by the distribution-counting algorithm. 2. (9 points) Consider the problem of searching for genes in RNA sequences using the Boyer-Moore algorithm. An RNA sequence consists of a text on the alphabet fA, C, G, U and the gene or gene scgment is the pattern. Construct the bad symbol shift table for the pattern AUCGGAU. Construct the good suffiz shift table for the pattern AUCGGAU Apply the Boyer-Moore algorithm to locate the above pattern in the following DNA sequence: ACGUGGGGCCCAAAAUCGGAUAACCC