Question Consider the network in the following Figure. B 3 F 1 1 D E Find the optimal (summary) routing tables for nodes B and F. An optimal routing table is one with the least number of rows. Each row must contain only one value for the destination and next router, with the exception that you can use in the destination column to indicate any value". In forwarding, assume the table is processed row by row: if one row matches, then the subsequent rows are ignored. Your