)is every minimum bottleneck tree of g a minimum spanning tree of g? prove or give a counter example

The answer is false. To explain further, let G have vertices {v1, v2, v3, v4}, with ends between each pair of vertices, and with the mass on the edge from vi to vj equal to I + j. Then each tree has a bottle neck edge mass of as a minimum of 5, so the tree containing of a track through vertices v3, v2, v1,v4 is a least bottleneck tree. It is not a least spanning tree, though, subsequently its total mass is greater than that of the tree with edges from v1 to every single vertex.

the abdomen (less formally called the belly, stomach, tummy or midriff) constitutes the part of the body between the thorax (chest) and pelvis, in humans and in other vertebrates. the region occupied by the abdomen is termed the abdominal cavity. the stomach secretes acid and enzymes that digest food. ridges of muscle tissue called rugae line the stomach. the stomach muscles contract periodically, churning food to enhance digestion. the pyloric sphincter is a muscular valve that opens to allow food to pass from the stomach to the small intestine.

the question isn't complete here so i can't right an answer '_'