Problem 3. (20 points) Consider a fair-queuing server where there are two flows, f and g, all with fixed packet sizes of 1000 bits, and the output channel bandwidth is 100 bits/sec Assume at real-time 0 packet f,1 arrives. Then packet g,l arrives at real-time 6 sec. For every packet, Show me its F value, i.e., the fake time of the finishing time of the packet in the fake server