$3.$ Consider the network below.

a$.$ Suppose that this network is a datagram network. Show the forwarding table in router A$,$ such that all traffic destined to host H$3$ is forwarded through interface $3.$

a$.$ Suppose that this network is a datagram network. Can you write down a forwarding table in router A$,$ such that all traffic from H$1$ destined to host H$3$ is forwarded through interface $3,$ while all traffic from H$2$ destined to host H$3$ is forwarded through interface $4?($Hint: this is a trick question.$)$

a$.$ Now suppose that this network is a virtual circuit network and that there is one ongoing call between H$1$ and H$3,$ and another ongoing call between H$2$ and H$3.$ Write down a forwarding table in router A$,$ such that all traffic from H$1$ destined to host H$3$ is forwarded through interface $3,$ while all traffic from H$2$ destined to host H$3$ is forwarded through interface $4.$

a$.$ Assuming the same scenario as $($c$),$ write down the forwarding tables in nodes B$,$ C$,$ and D$.$