Hi guys,

I just finished doing my homework assignment on spanning trees and I wanted some reassurance that I've done it correctly. I'm not looking for someone to state a correction, but rather let me know I've made a mistake (if I have).

Here are my edges for **Prim's Algorithm**

(1,2) - (1,5) - (5, 7) - (7, 11) - (7, 8) - (8, 4) - (2, 3) - (11, 13) - (3, 10) - (10, 12) - (12, 9) - (12, 14)

Here are my edges for **Kruskal's Algorithm**

(7, 11) - (1, 2) - (10, 12) - (4, 8) - (7, 8) - (9, 12) - (1, 5) - (5, 7) - (2, 3) - (12, 14) - (11, 13) - (3, 10) - (5, 6)