Διορθώστε Κάτι

It's one excersize. It's a matter of minutes or maximum half an hour for someone who knows about that. I need that today for no more than 10 USD. PLEASE DOWNLOAD THE ATTACHMENT DOCX FILE WITH THE TABLES TO FILL IN Question 2 In a Pastry network node is searched with key 3012. We assume that the search starts at the "first node", which has no common prefix with the key. The first node searches the routing table and forwards the query to a "second node", which is closer to the key, but is not responsible for the key 3012. The 'third node "should be the node where the search achieves after the message from that promoted straight to the destination node. Fill in the routing tables of the three nodes and assign appropriate values for the sheet sets. We assume that the network is dense enough to fill all the cells of the tables. PLEASE DOWNLOAD THE ATTACHED DOCX TO FILL IN THE 3 LITTLE TABLES