separate sheets provided. No additional sheets are required and they won't be gi 1. a. A primitive transport protocol uses only two sequence numbers and implements lossless order- preserving delivery feature by sending the message with the alternate sequence number only after the message with a sequence number is acknowledged. Will this protocol work correctly? Make a case for (3 Marks) sliding window protocols based on the shortcomings of this protocol. b. What is the fundamental difference between Go Back To N and Selective Repeat algorithm. Assuming a window size of 4, draw a message flow diagram for the scenario of packet 3 getting lost in the transmission of packets 0 through 5 from the sender side TCP layer to receiver side TCP layer using selective repeat algorithm. Discuss the maximal window sizes in the for an N-bit long sequence number (7 Marks) field for the GO Back to N and Selective Repeat algorithms. 2. a. Find the minimal cost path from I to U in the following network using Dijkstra's link state algorithm. (4 Marks) V 3 3 6 Z U 4 3 Y b. Explain Bellman and Ford's distance vector algorithm using a 3 node example and briefly discuss count to infinity problem associated with the algorithm. (2 Marks) 3. Discuss briefly the purpose and the implementation of the ICMP, ARP, RARP, and DHCP algorithms in the network layer. (4 Marks)