Q1. Given that the network addresses are 8 bits long. Suppose that a router has the following prefixes in the forwarding table: 10*, 010* 0110*, 1111*, 10001*, 110011*, 100100*, 0111001* Now the binary search is used for LPM in the router. Construct the search table that contains the following fields: Binary Value where the ">" column contains the LPM result for the input address having a binary value greater than the current entry but smaller than the next one. The "="column contains the LPM result for the address having the same binary value with the current entry. (15 marks) Q1. Given that the network addresses are 8 bits long. Suppose that a router has the following prefixes in the forwarding table: 10*, 010* 0110*, 1111*, 10001*, 110011*, 100100*, 0111001* Now the binary search is used for LPM in the router. Construct the search table that contains the following fields: Binary Value where the ">" column contains the LPM result for the input address having a binary value greater than the current entry but smaller than the next one. The "="column contains the LPM result for the address having the same binary value with the current entry. (15 marks)