1. Show the outline of a routing table for Pastry with address space of 16 and b = 2. Give some possible entries for each cell in the routing table of Node N21.
2. In a Pastry network using DHT, in which m = 4 and b = 2, draw the identifier space with four nodes, N02, N11, N20, and N23, and three keys, k00, k12, and k24. Determine which node is responsible for each key. Also show the leaf set and routing table for each node. Although it is unrealistic, assume that the proximity metric between each two nodes is based on numerical closeness.