statement 1: wrong.because there may be a shortest path, but it is not included in MST as it may cause a Loop
Statement 2 is correct .look at simple average .n*tavg will result in the entire graph..but to be MST, you have to take n-1 edges at most.
so it will be (n-1)*T avg at most
N=number of vertices
So B is correct answer
hope u got my point