Q1. Given that the network addresses are 8 bits long. Suppose that a router has the following prefixes in the forwarding table: *,1*, 10*, 010* 0110*, 1111*, 10001*, 110011*, 100100*, 0111001* (a) Assume that the binary search method based on prefix length is now used for LPM (longest prefix match) in the router. (i) Show the binary searching tree for all hash tables. (4 marks) (ii) Write down the contents of the tables with size 4. Given that the table contains the following fields: Prefix Flag LSF where the Flag (On or Off) is used to indicate whether there is a longer prefix and LSF is used to indicate the longest prefix found so far (measured in number of bits). (4 marks) Q1. Given that the network addresses are 8 bits long. Suppose that a router has the following prefixes in the forwarding table: *,1*, 10*, 010* 0110*, 1111*, 10001*, 110011*, 100100*, 0111001* (a) Assume that the binary search method based on prefix length is now used for LPM (longest prefix match) in the router. (i) Show the binary searching tree for all hash tables. (4 marks) (ii) Write down the contents of the tables with size 4. Given that the table contains the following fields: Prefix Flag LSF where the Flag (On or Off) is used to indicate whether there is a longer prefix and LSF is used to indicate the longest prefix found so far (measured in number of bits). (4 marks)