Consider a connected graph G with at least 4 edges that has all distinct edge weights. Which of the following properties must be true of a Minimum Spanning Tree (MST) of G? I. The MST must contain the...

Extracted text: Consider a connected graph G with at least 4 edges that has all distinct edge weights. Which of the following properties must be true of a Minimum Spanning Tree (MST) of G? I. The MST must contain the shortest edge of G. II. The MST must contain the second-shortest edge of G. III. The MST can never contain the longest edge of G. None I Only I and II Only I and III Only O1, II, and III