Learning Switches $-$ Basics.

Consider the LAN below consisting of $10$ computers connected by two self$-$learning Ethernet switches.

At $t=0$ the switch table entries for both switches are empty. At $t=1,2,3,$ and $4,$ a source ends to a destination as shown below, and the

destination replies immediately $($well before the next time step$).$

Assume that the following connections occur:

$t=1$ : $CL(C$ has sent a frame to $L$ and $L$ has responded to $C)$

$t=2$ : $KH(K$ has sent a frame to $H$ and $H$ has responded to $K)$

$t=3$ : $D->A(D$ has sent a frame to A and A has responded to $D)$

$t=4$ : $B->F(B$ has sent a frame to $F$ and $F$ has responded to $B)$

Find out how the two switch tables will be filled out and answer the questions below. The answer to the question below is given as a sample.

Can you help me answer these questions below? Please do not copy previous answer and explain in detail. Thanks a lot.

$1.$ At t$=1,$ what is the destination entry for switch $1?$

$2.$ At t$=1,$ what is the source entry for switch $2?$

$3.$ At t$=1,$ what is the destination entry for switch $2?$

$4.$ At t$=2,$ what is the source entry for switch $1?$

$5.$ At t$=2,$ what is the destination entry for switch $1?$

$6.$ At t$=2,$ what is the source entry for switch $2?$

$7.$ At t$=2,$ what is the destination entry for switch $2?$