1. Kruskal's algorithm is a method of finding:

b. the number of spanning trees that traverse each edge exactly once

Nope, see "Kruskal's Algorithm" under "CONCEPT: A FOREST OF TREES" in Topic 04: Minimal-Cost Spanning Trees (paragraph just before the "OXYGEN LINE ROUTE PROBLEM").

Question #5