A router internally uses a fixed$-$stride multibit trie to store its forwarding table; the trie has three levels of nodes after the root node, with $8$ bits, $16$ bits, and $8$ bits strides respectively. At one point of time, the router stores the forwarding table in this trie shown as Table $1.$

$($a$)$ Draw the trie.

$($b$)$ It now needs to update its table by adding the routes shown in Table $2.$ Re$-$draw the parts of the trie that will be visited, modified, or created in inserting these rules, or would be visited when exercising these rules $($i$.$e$.$ you need to re$-$draw the trie as it is after the insertion, but not the parts that did not change$).$ Indicate, among the nodes you draw, which were newly created because of A router internally uses a fixed$-$stride multibit trie to store its forwarding table; the trie has

three levels of nodes after the root node, with $8$ bits, $16$ bits, and $8$ bits strides respectively. At

one point of time, the router stores the forwarding table in this trie shown as Table $1$ below.

Table $2$these insertions.

Note: if you summarize multiple nodes, it must remain clear how many and what separate nodes you are drawing