To prove that the minimal spanning tree in graph is unique.

Suppose you have n video streams that need to be sent, one after another, over a communication link. Stream I consists of a total of b_i bits that need to be sent, at a constant rate, over a period of t_i seconds. You cannot send two streams at the same time, so you need to determine a schedule for the streams: an order in which to send them. Whichever order you choose, there cannot be any delays between the end of one stream and the start of the next. Suppose you schedule starts at time 0(and therefore ends at time ∑ⁿ_i=0 t_{i ,}whichever order you chose).we assume that all the values b_i  and t_i  are positive integers.

Now, because you are just one user ,the link does not want you taking up too much bandwidth, so it imposes the following constraint ,using a fixed parameter r:

(*) for each natural number t>0,the total number of bits you send over the time interval from 0 to t cannot exceed rt.

Note that this constraint is only imposed for time intervals that start at 0, not for time intervals that start at any other value.

We say that a schedule is valid if it satisfies the constraint (*) imposed by the link.

The problem given a set of n streams, each specified by its number of bits b_i and its time duration t_{i ,}as well as the link parameter r, determine whether there exist a valid schedule.

Example: suppose we have n=3 streams, with

(b_1, t₁)=(2000,1)       (b_2, t₂)=(6000,2)         (b_3, t₃)=(2000,1)

and suppose the link's parameter is r=5000.then the schedule that n runs the streams in the order 1,2,3 is valid, since the constant (*) is satisfied:

t=1; the whole first stream has been sent, and 2000<5000

t=2 ; half of the second stream has also been sent and 2000+3000 <5000

Similar calculations hold for t=3 and t=4

consider the following claim :

there exists a valid schedule if and only if each stream I satisfies b_i <= rt_i

Decide whether you think the claim is true or false and give a proof of either the claim or its negation.