A particular source uses the Lempel-Ziv-Welch algorithm to communicate with a receiver. The message that the source wishes to communicate is made up of just three symbols: a, b, c. These symbols are respectively stored in positions 1, 2 and 3 in the dictionary at both the source and the receiver. The subsequent dictionary entries, as they are built by the LZW algorithm, are assigned to positions numbered 4, 5, 6, . Suppose the transmitted sequence is 2, 4, 5, 1, 3, 4, 7, 10, 11, 6, 10.

Decode the sequence, and write down the receiver's entire dictionary at the end of the transmission.