Let's say it takes 1 second for a packet to get from sender to receiver and vice versa. Assume a timeout takes 4 seconds. Let's say that 6 data segments, each with the size of 10000 bits, are sent at once and the third (and only the third one) one is lost. Assume acknowledgements are 100 bits. How many LESS Total bits are transmitted in Selective Repeat (total bits transmitted from sender to receiver and receiver back to sender) to get all 6 segments to the receiver than in Go Back N (which you answered in the last problem) assuming that the receiver always gets an initially lost packet the second time around.