Suppose you have to create a B+-tree index on a large number of names, where the maximum size of a name may be quite large (say 40 characters) and the average name is itself large. Explain how prefix compression can be used to maximize the average fanout of non-leaf nodes.