An alphabet contains symbols A, B, C, D, E, F. The frequencies of the symbols are 35%, 20%, 15%, 15%, 8%, and 7%, respectively. Given an input encoding of size n bits, design an O(n) algorithm that determines how many different decodings of those n bits are possible using the table above. Since this requires dynamic programming, please describe the "Heart of the Algorithm."

Symbol Codeworod 0 10 01 011