Problem:
Question 1- Write Pseudocode and Program in JAVA code for Closest-Pair Problem using Divide & Conquer.
Question 2- With a GBN protocol, assume sender cycles through only 4 distinct sequence numbers (1-2-3-4-1 etc.) for window size 4. assume the network can lose packets but the network delay is zero (negligible). give a specific packet exchange scenario where the receiver will deliver wrong data to the application.
Write the code step by step and explain it.