Web and Peer-to-Peer 5. (6 points) Provide three reasons a company might prefer to pay Akamai to host their webpage instead of putting it onto a peer-to-peer network (such as Napster) for free. 6. (4 points) We saw no examples of of chunk-based peer-to-peer networks that use flooding. What would make such a network inefficient? 7. (4 points) While not strictly true, people tend to view hash tables as offering constant time look up in practice. (The possibility of a bad hash function leading to many collisions is why it is not strictly constant time.) Distributed Hash Tables (DHTS), on the other hand, only offer O(log n)-time lookup where n is the number of nodes in the DHT. This is odd, since the two appear to be equivalent, i.e. simply map each entry in a traditional hash table onto a node in the DHT. What property or requirement of a DHT makes this approach impractical in practice.