How would a patricia tree look like after adding a word that starts as the substring of another but has additional letters?

Question

Take this trie as example:

I want to add the word "luan" to this representation, but luan takes 20 bits to represent, while lua takes 15. So, they "differ" from each other on the 16th bit, but "lua" has no value there to compare. So how would this trie look like?