Question $6$: $(10$ Points$)$ Consider AS$-1,$ AS$-2,$ AS$-3,$ and AS$-4$ in the figure below $($not all ASes are shown$).$

Suppose that the gateway routers of AS$-1$ receive the following BGP advertisements from their BGP peers:

$\backslash$table$[[$AS$-2],[$Destination Network,AS Path$],[221\mathrm{.}92\mathrm{.}66\mathrm{.}0/24,$AS$-2$ AS$-89]]$

$\backslash$table$[[$AS$-3],[$Destination Network,AS Path$],[1\mathrm{.}2\mathrm{.}3\mathrm{.}0/24,$AS$-3],[115\mathrm{.}206\mathrm{.}110\mathrm{.}0/24,$AS$-3$ AS$-11$ AS$-16$ AS$-34]]$

$\backslash$table$[[$AS$-4],[$Destination Network,AS Path$],[175\mathrm{.}95\mathrm{.}0\mathrm{.}0/16,$AS$-4],[5\mathrm{.}6\mathrm{.}10\mathrm{.}0/24,$AS$-4$ AS$-11$ AS$-34]]$

Suppose AS$-1$ uses a link state routing protocol to find the least cost paths within the AS$.$ Also, assume that no routes are rejected due to local policy rules. Complete the forwarding table that will be formed in router $x$ as a result of these advertisements. $($Fill in the below and expand it as needed$).$

$\backslash$table$[[$Destination Network,interface,Why this interface was chosen$],[,,]]$