Generalize the hierarchical network in Figure 7.27 so that the $2^K$ nodes are interconnected in a full mesh at the top of the hierarchy and so that each node connects to two $2^L$ nodes in the next lower level in the hierarchy. Suppose there are four levels in the hierarchy.
a. How many nodes are in the hierarchy?
b. What does a routing table look like at level $j$ in the hierarchy, $j=1,2,3$, and 4 ?
c. What is the maximum number of hops between nodes in the network?