Mark all that apply by writing either T $($for true$)$ or F $($for false$)$ in the blank box before each statement. The LZW algorithm, applied to a message M:

Maintains a directory of strings, initialized with all individual characters in the underlying alphabet and updated with prefix substrings found in M$.$

Concatenates the longest prefix of M that has a codeword in the directory with the next character of M after that prefix and adds the result to the directory.

Handles the decoding exception by copying the first character of the missing string to the end of that string.

Successively encodes the shortest suffix of M found in the directory with the index of that suffix in the directory.