You are given a graph G with n vertices and m edges, and a minimum spanning tree T of the graph. Suppose one of the edge weights w(e) of the graph is updated. Give an algorithm that runs in time O(m) to test if T still remains the minimum spanning tree of the graph. You may assume that all edge weights are distinct both before and after the update. HINT: If e ∈ T, consider the cut obtained by deleting e from T. If e /∈ T, consider the cycle formed by adding e to T

The correct answer would be a.

Hey there: )if its a true or false question, then your answer is truehope that -take care now--ans

Function tipcalculate (slider, bill){  var tip = document.getelementbyid('tipamount');   var slideval = document.getelementbyid('slideval');   var bill = document.getelementbyid(bill).value;   var prcnt = slider * .01;       if (bill == null || bill == '') {      tip.innerhtml = ' enter an amount';       return false;   }  if(isnan(bill)) {      tip.innerhtml = ' enter a number';       return false;   }  if(bill > = 0){      tip.innerhtml = '$' + (bill * prcnt) .tofixed(2);   slideval.innerhtml = slider + '%';   }}