2. Given that the network addresses are 6 bits in length. Suppose that a router has the following prefixes in the forwarding table: 01*, 10*, 110*, 001*, 1101*, 0111* (a) Assume that the binary search method based on prefix length is used for LPM in the router. Show the binary searching tree for all hash tables. Also write down the content of the table with size 3. 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). (b) Now the binary search is used for LPM in the router. Construct the search table that contains the following fields: Binary Value where the x 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. 2. Given that the network addresses are 6 bits in length. Suppose that a router has the following prefixes in the forwarding table: 01*, 10*, 110*, 001*, 1101*, 0111* (a) Assume that the binary search method based on prefix length is used for LPM in the router. Show the binary searching tree for all hash tables. Also write down the content of the table with size 3. 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). (b) Now the binary search is used for LPM in the router. Construct the search table that contains the following fields: Binary Value where the x 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