Balanced Sliding-window protocol in distributed algorithm problem

The balanced sliding-window protocol satisfies the eventual delivery requirement if the follow- ing two fairness assumptions are satisfied. (F1) If the sending of a packet is applicable for an infinitely long time, the packet is sent infinitely often. (F2) If the same packet is sent infinitely often, it is received infinitely often. Show that the balanced sliding-window protocol does not satisfy the eventual delivery require- ment if, of the fairness assumptions only (F2) holds. The balanced sliding-window protocol satisfies the eventual delivery requirement if the follow- ing two fairness assumptions are satisfied. (F1) If the sending of a packet is applicable for an infinitely long time, the packet is sent infinitely often. (F2) If the same packet is sent infinitely often, it is received infinitely often. Show that the balanced sliding-window protocol does not satisfy the eventual delivery require- ment if, of the fairness assumptions only (F2) holds