Question 28 3 pts An ISP has an available address space of 172.16.0.0/16 to issue to customers. The ISP needs to divide this address space equally between 32 different organizations. How many hosts can be supported by each of the organizations? (Remember you must subtract the first and last addresses in each address block for the network number and the broadcast address.) 4094 1022 8190 2046 Question 29 Consider the network diagram below. 11 3 X 9 6 3 2 7 6 2 4 1 u 2 4 pts W With the indicated link costs, you can use Dijkstra's Shortest Path Algorithm to compute the shortest path from node x to all other network nodes, and place them in a table like the one shown in Table 5.1 on page 381 of the text. After the initialization (step 0) of Djikstra's algorithm, what is the tentative distance to node u? And after the 1st step iteration of Djikstra's algorithm, what is the tentative distance to node u? Initialization: 11, 1st step: 6 Initialization: ; 1st step: 7 Initialization: ; 1st Step: 8 Initialization: 8; 1st step: 6 Question 34 Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding table: Prefix 11 Match Interface 0 011 1 10 1 00 2 0100 3 Default 4 What is the number of possible addresses that will be forwarded to interface 1? O 128 96 46 64 32 Question 35 3 pts If Bob receives an encrypted reply message from Alice, whose private key is used to decrypt the received message? Bob's private key and Alice's public key Alice's private key Bob's private key The Certificate Authority's public key 3 pts