(b) (c) The diagram below shows the routing tables of routers R1, R2, R3 and R4, which connect multiple networks together. Show (in detail) what happens when router R1 receives a packet with destination address of 195.2.6.47. Assume 255.255.255.0 is used as the network mask by all routers. Dest. Hop Next 130.10.0.0 130.11.0.0 2 130.10.0.2 195.2.4.0 195.2.5.0 1 195.2.6.0 2 195.2.5.2 205.5.5.0 3 130.10.07 205.5.6.0 3 130.10.0.2 R2 Table Dest. Hop Next 130.10.0.0 2 195.2.5.1 130.11.0.0 3 195.2.5.1 195.2.4.0 2 195.2.5.1 195.2.5.0 195.2.6.0 1 205.5.5.0 4 195.2.5.1 205.5.6.0 4 195.2.5.1 R3 Table R2 195.2.4.0 R3 195.2.4.1 195.2.5.1 X 130.10.0.1 195.2.5.0 195.2.5.2 195.2.6.1 130.10.0.0 195.2.6.0 R1 130.11.0.0 Dest. Hop 130.10.0.0 1 130.11.0.0 1 195.2.4.0 2 130.10.0.1 195.2.5.0 2 130.10.0.1 195.2.6.0 3 130.10.0.1 205.5.5.0 2 130.11.0.1 205.5.6.0 2 130.11.0.1 R1 Table Next 205.5.5.1 R4 130.11.0.1 205.5.6.1 205.5.5.0 Dest. Hop Next 130.10.0.0 2 130.11.0.2 130.11.0.0 1 195.2.4.0 3 130.11.0.2 195.2.5.0 3 130.11.0.2 130.11.02 195.2.6.0 4 205.5.5.0 1 205.5.6.0 1 R4 Table 205.5.6.0 (5/100) Among the common transport layer protocols are: Simple, Stop-and-Wait, Go- Back-N (GBN), Selective-Repeat (SR) and Piggybacking. (i) When a data packet is lost during transmission, how does Simple protocol handle the situation? Give one (1) weakness of Stop-and-Wait protocol. (iii) Briefly explain how the weakness mentioned in 4(c)(ii) is overcome using Go-Back-N protocol. (iv) Which protocol(s) use sliding window in their implementations? (10/100)