Algorithm

Answer yes, no, or don't know.

Explanation would be great.

Check whichever applies to given claims. Explain your answers. The Minimum Spanning Tree of a connected weighted graph with 40 edges always a. Contains the least weight edge Always Sometimes Never b. Contains 2 least weight edges Always Sometimes Never c. Contains 3 least weight edges Always Sometimes Never d. Has at least 9 edges Always Sometimes Never e. Has at least 10 edges Always Sometimes Never Check whichever applies to given claims. Explain your answers. The Minimum Spanning Tree of a connected weighted graph with 100 edges always a. Contains the least weight edge Yes No b. Contains 2 least weight edges Yes No c. Contains 3 least weight edges Yes No d. Has at least 14 edges Yes No e. Has at least 15 edges Yes No